Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (Q2875151): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:29, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses |
scientific article |
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
