A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:45, 30 January 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
