A Computing Procedure for Quantification Theory (Q5613969): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Davis-Putnam method / rank
 
Normal rank
Property / cites work
 
Property / cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation: An algorithm for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative runtime analysis of heuristic algorithms for satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876725 / rank
 
Normal rank

Latest revision as of 02:53, 12 June 2024

scientific article; zbMATH DE number 3336835
Language Label Description Also known as
English
A Computing Procedure for Quantification Theory
scientific article; zbMATH DE number 3336835

    Statements