Propositional proofs and reductions between NP search problems (Q435190)
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: Propositional proofs and reductions between NP search problems |
scientific article; zbMATH DE number 6054355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propositional proofs and reductions between NP search problems |
scientific article; zbMATH DE number 6054355 |
Statements
Propositional proofs and reductions between NP search problems (English)
0 references
11 July 2012
0 references
search problems
0 references
Nullstellensatz
0 references
propositional proofs
0 references
polynomial-time reducibility
0 references
0 references
0.8417106866836548
0 references
0.7948459386825562
0 references
0.7764606475830078
0 references
0.7760183811187744
0 references
0.7732396125793457
0 references
