Volume Computation for Boolean Combination of Linear Arithmetic Constraints (Q5191119): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4518985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing the Volume of a Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Propositional Model Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 20:52, 1 July 2024

scientific article; zbMATH DE number 5587956
Language Label Description Also known as
English
Volume Computation for Boolean Combination of Linear Arithmetic Constraints
scientific article; zbMATH DE number 5587956

    Statements