A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655)
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: A satisfiability algorithm and average-case hardness for formulas over the full binary basis |
scientific article; zbMATH DE number 6189567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A satisfiability algorithm and average-case hardness for formulas over the full binary basis |
scientific article; zbMATH DE number 6189567 |
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
0.8850858807563782
0 references
0.7945286631584167
0 references
0.7845905423164368
0 references
0.7806015014648438
0 references
0.780525267124176
0 references
