Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/0304-3975(86)90135-0> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- 0304-3975(86)90135-0 doi "10.1016/0304-397590135-0".
- 0304-3975(86)90135-0 first1 "L.".
- 0304-3975(86)90135-0 first2 "V.".
- 0304-3975(86)90135-0 isCitedBy Boolean_satisfiability_problem.
- 0304-3975(86)90135-0 isCitedBy Isolation_lemma.
- 0304-3975(86)90135-0 isCitedBy Leslie_Valiant.
- 0304-3975(86)90135-0 isCitedBy Structural_complexity_theory.
- 0304-3975(86)90135-0 isCitedBy Valiant–Vazirani_theorem.
- 0304-3975(86)90135-0 journal "Theoretical Computer Science".
- 0304-3975(86)90135-0 last1 "Valiant".
- 0304-3975(86)90135-0 last2 "Vazirani".
- 0304-3975(86)90135-0 pages "85–93".
- 0304-3975(86)90135-0 ref "harv".
- 0304-3975(86)90135-0 title "NP is as easy as detecting unique solutions".
- 0304-3975(86)90135-0 url "http://www.cs.princeton.edu/courses/archive/fall05/cos528/handouts/NP_is_as.pdf".
- 0304-3975(86)90135-0 volume "47".
- 0304-3975(86)90135-0 year "1986".