Matches in DBpedia 2016-04 for { <http://doi.org/10.1006/jcss.1998.1583> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- jcss.1998.1583 author1Link "Manindra Agrawal".
- jcss.1998.1583 author2Link "Eric Allender".
- jcss.1998.1583 author3Link "Steven Rudich".
- jcss.1998.1583 doi "10.1006/jcss.1998.1583".
- jcss.1998.1583 first1 "M.".
- jcss.1998.1583 first1 "Manindra".
- jcss.1998.1583 first2 "E.".
- jcss.1998.1583 first2 "Eric".
- jcss.1998.1583 first3 "Steven".
- jcss.1998.1583 isCitedBy Berman–Hartmanis_conjecture.
- jcss.1998.1583 isCitedBy Gadget_(computer_science).
- jcss.1998.1583 isCitedBy NP-completeness.
- jcss.1998.1583 isCitedBy Steven_Rudich.
- jcss.1998.1583 issn "1090-2724".
- jcss.1998.1583 issue "2".
- jcss.1998.1583 journal Journal_of_Computer_and_System_Sciences.
- jcss.1998.1583 journal "Journal of Computer and System Sciences".
- jcss.1998.1583 last1 "Agrawal".
- jcss.1998.1583 last2 "Allender".
- jcss.1998.1583 last3 "Rudich".
- jcss.1998.1583 location "Boston, MA".
- jcss.1998.1583 pages "127–143".
- jcss.1998.1583 publisher Academic_Press.
- jcss.1998.1583 ref "harv".
- jcss.1998.1583 title "Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem".
- jcss.1998.1583 title "Reductions in circuit complexity: an isomorphism theorem and a gap theorem".
- jcss.1998.1583 volume "57".
- jcss.1998.1583 year "1998".