A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00037-013-0067-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00037-013-0067-7 / rank | |||
Normal rank | |||
Latest revision as of 15:17, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A satisfiability algorithm and average-case hardness for formulas over the full binary basis |
scientific article |
Statements
A satisfiability algorithm and average-case hardness for formulas over the full binary basis (English)
0 references
19 July 2013
0 references
satisfiability
0 references
exact algorithm
0 references
formula
0 references
parity gate
0 references
average-case hardness
0 references
0 references
0 references
