Matches in DBpedia 2016-04 for { <http://doi.org/10.1007/s00037-004-0182-6> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- s00037-004-0182-6 doi "10.1007/s00037-004-0182-6".
- s00037-004-0182-6 first1 "V.".
- s00037-004-0182-6 first2 "R.".
- s00037-004-0182-6 isCitedBy Circuit_complexity.
- s00037-004-0182-6 journal "Computational Complexity".
- s00037-004-0182-6 last1 "Kabanets".
- s00037-004-0182-6 last2 "Impagliazzo".
- s00037-004-0182-6 number "1".
- s00037-004-0182-6 pages "1–46".
- s00037-004-0182-6 title "Derandomizing polynomial identity tests means proving circuit lower bounds".
- s00037-004-0182-6 volume "13".
- s00037-004-0182-6 year "2004".