A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6189567 / rank
 
Normal rank
Property / zbMATH Keywords
 
satisfiability
Property / zbMATH Keywords: satisfiability / rank
 
Normal rank
Property / zbMATH Keywords
 
exact algorithm
Property / zbMATH Keywords: exact algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
formula
Property / zbMATH Keywords: formula / rank
 
Normal rank
Property / zbMATH Keywords
 
parity gate
Property / zbMATH Keywords: parity gate / rank
 
Normal rank
Property / zbMATH Keywords
 
average-case hardness
Property / zbMATH Keywords: average-case hardness / rank
 
Normal rank

Revision as of 10:11, 28 June 2023

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
    0 references
    0 references
    19 July 2013
    0 references
    0 references
    satisfiability
    0 references
    exact algorithm
    0 references
    formula
    0 references
    parity gate
    0 references
    average-case hardness
    0 references