Approximate counting in SMT and value estimation for probabilistic programs (Q1683928): Difference between revisions

@@ Property / cites work @@
+On Approximation Algorithms for # P
@@ Property / cites work: On Approximation Algorithms for # P / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
+Normal rank
@@ Property / cites work @@
+Uniform generation of NP-witnesses using an NP-oracle
+Normal rank
@@ Property / cites work @@
+A random polynomial-time algorithm for approximating the volume of convex bodies
+Normal rank
@@ Property / cites work @@
+On the Complexity of Computing the Volume of a Polyhedron
+Normal rank
@@ Property / cites work @@
+Polytope Volume Computation
@@ Property / cites work: Polytope Volume Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Making random choices invisible to the scheduler
@@ Property / cites work: Making random choices invisible to the scheduler / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Counting in SMT and Value Estimation for Probabilistic Programs
+Normal rank
@@ Property / cites work @@
+Probabilistic Abstract Interpretation
@@ Property / cites work: Probabilistic Abstract Interpretation / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and Reasoning with Bayesian Networks
@@ Property / cites work: Modeling and Reasoning with Bayesian Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Probability
@@ Property / cites work: Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382287
@@ Property / cites work: Q4382287 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantics of probabilistic programs
@@ Property / cites work: Semantics of probabilistic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability modulo counting
@@ Property / cites work: Satisfiability modulo counting / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating the volume of solution space for satisfiability modulo linear real arithmetic
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Linear-Invariant Generation for Probabilistic Programs:
+Normal rank
@@ Property / cites work @@
+Q3655273
@@ Property / cites work: Q3655273 / rank @@
+Normal rank
@@ Property / cites work @@
+Games against nature
@@ Property / cites work: Games against nature / rank @@
+Normal rank
@@ Property / cites work @@
+Volume Computation for Boolean Combination of Linear Arithmetic Constraints
+Normal rank
@@ Property / cites work @@
+Abstraction, Refinement and Proof for Probabilistic Systems
+Normal rank
@@ Property / cites work @@
+Abstract interpretation of programs as Markov decision processes
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank