Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928)
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 6472745
| 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 6472745 |
Statements
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (English)
0 references
14 August 2015
0 references
sparsification
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
vertex cover
0 references
vertex deletion problems
0 references
