Hard satisfiable instances for DPLL-type algorithms (Q2577593): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sergey I. Nikolenko / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57101178 / rank
 
Normal rank
Property / author
 
Property / author: Sergey I. Nikolenko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-005-0105-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024260528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold in proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Sat and upper bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: New worst-case upper bounds for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT local search algorithms: Worst-case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 14:38, 11 June 2024

scientific article
Language Label Description Also known as
English
Hard satisfiable instances for DPLL-type algorithms
scientific article

    Statements