Partitioning methods for satisfiability testing on large formulas (Q4647562): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687274 / rank
 
Normal rank

Latest revision as of 20:49, 17 July 2024

scientific article; zbMATH DE number 7001950
Language Label Description Also known as
English
Partitioning methods for satisfiability testing on large formulas
scientific article; zbMATH DE number 7001950

    Statements

    Identifiers