Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Dieter van Melkebeek, Holger Dell. Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. Electronic Colloquium on Computational Complexity (ECCC), 17:38, 2010. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy CollapsesHolger Dell, Dieter van Melkebeek. Dagstuhl 2009: [doi] Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapsesHolger Dell, Dieter van Melkebeek. stoc 2010: 251-260 [doi] Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy CollapsesHolger Dell, Dieter van Melkebeek. JACM, 61(4):23, 2014. [doi] Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy CollapsesAdam Klivans, Dieter van Melkebeek. stoc 1999: 659-667 [doi] Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy CollapsesAdam Klivans, Dieter van Melkebeek. SICOMP, 31(5):1501-1526, 2002. [doi]
The following publications are possibly variants of this publication: