Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (Q2875151)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses |
scientific article; zbMATH DE number 6330064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses |
scientific article; zbMATH DE number 6330064 |
Statements
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (English)
0 references
13 August 2014
0 references
arithmetic progression free sets
0 references
feedback vertex set
0 references
hereditary graph properties
0 references
kernelization
0 references
parameterized complexity
0 references
probabilistically checkable proofs
0 references
satisfiability
0 references
sparsification
0 references
vertex cover
0 references
vertex deletion problems
0 references
0.997303545475006
0 references
0.8007069230079651
0 references
0.7989006042480469
0 references
0.7974808812141418
0 references
0.7967479228973389
0 references
