Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/j.jcss.2008.11.001> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- j.jcss.2008.11.001 accessdate "2013-09-19".
- j.jcss.2008.11.001 date "June 2009".
- j.jcss.2008.11.001 doi "10.1016/j.jcss.2008.11.001".
- j.jcss.2008.11.001 first1 "Eric".
- j.jcss.2008.11.001 first2 "Michael".
- j.jcss.2008.11.001 first3 "Neil".
- j.jcss.2008.11.001 first4 "Henning".
- j.jcss.2008.11.001 first5 "Heribert".
- j.jcss.2008.11.001 isCitedBy Schaefers_dichotomy_theorem.
- j.jcss.2008.11.001 issue "4".
- j.jcss.2008.11.001 journal "Journal of Computer and System Sciences".
- j.jcss.2008.11.001 last1 "Allender".
- j.jcss.2008.11.001 last2 "Bauland".
- j.jcss.2008.11.001 last3 "Immerman".
- j.jcss.2008.11.001 last4 "Schnoor".
- j.jcss.2008.11.001 last5 "Vollmer".
- j.jcss.2008.11.001 pages "245–254".
- j.jcss.2008.11.001 publisher "Elsevier".
- j.jcss.2008.11.001 title "The complexity of satisfiability problems: Refining Schaefer's theorem".
- j.jcss.2008.11.001 url "http://www.cs.umass.edu/~immerman/pub/cspJCSS.pdf".
- j.jcss.2008.11.001 volume "75".