Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130962558, #quickstatements; #temporary_batch_1731342332091 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130962558 / rank | |||
Normal rank | |||
Latest revision as of 17:26, 11 November 2024
scientific article; zbMATH DE number 6472745
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
