Matches in DBpedia 2016-04 for { <http://doi.org/10.1145/1806689.1806725> ?p ?o }
Showing triples 1 to 11 of
11
with 100 triples per page.
- 1806689.1806725 contribution "Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses".
- 1806689.1806725 contributionUrl sparsification-stoc.pdf.
- 1806689.1806725 doi "10.1145/1806689.1806725".
- 1806689.1806725 first1 "Holger".
- 1806689.1806725 first2 "Dieter".
- 1806689.1806725 isCitedBy Kernelization.
- 1806689.1806725 last1 "Dell".
- 1806689.1806725 last2 "van Melkebeek".
- 1806689.1806725 pages "251–260".
- 1806689.1806725 title Symposium_on_Theory_of_Computing.
- 1806689.1806725 year "2010".