Estimating the volume of solution space for satisfiability modulo linear real arithmetic
From MaRDI portal
Publication:2345986
DOI10.1007/s00224-014-9553-9zbMath1328.68209OpenAlexW2075318537MaRDI QIDQ2345986
Shi He, Min Zhou, Ming Gu, Fei He, Gangyi Chen, Xiaoyu Song
Publication date: 29 May 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9553-9
Related Items
Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method, Computing and estimating the volume of the solution space of SMT(LA) constraints, Approximate counting in SMT and value estimation for probabilistic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric algorithms and combinatorial optimization
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- On the average number of steps of the simplex method of linear programming
- Solving SAT and SAT Modulo Theories
- Volume Computation Using a Direct Monte Carlo Method
- On the Complexity of Computing the Volume of a Polyhedron
- Symbolic execution and program testing
- Binary Decision Diagrams
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Random walks and anO*(n5) volume algorithm for convex bodies
- Computational experience with the reverse search vertex enumeration algorithm
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Choosing a Point from the Surface of a Sphere
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
