Propositional proofs and reductions between NP search problems (Q435190): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apal.2012.01.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065828765 / rank | |||
Normal rank | |||
Revision as of 21:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Propositional proofs and reductions between NP search problems |
scientific article |
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
