Phase transitions of PP-complete satisfiability problems (Q2643309): Difference between revisions

@@ Property / author @@
+Victor Dalmau
@@ Property / author: Victor Dalmau / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2068660261
@@ Property / OpenAlex ID: W2068660261 / rank @@
+Normal rank
@@ Property / cites work @@
+Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
+Normal rank
@@ Property / cites work @@
+Lower bounds for random 3-SAT via differential equations
+Normal rank
@@ Property / cites work @@
+On counting problems and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q4256519
@@ Property / cites work: Q4256519 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+A probabilistic analysis of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+A threshold for unsatisfiability
@@ Property / cites work: A threshold for unsatisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411392
@@ Property / cites work: Q4411392 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448374
@@ Property / cites work: Q4448374 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215779
@@ Property / cites work: Q4215779 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic Boolean satisfiability
@@ Property / cites work: Stochastic Boolean satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Dempster's rule of combination is {\#}P-complete
@@ Property / cites work: Dempster's rule of combination is {\#}P-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Generating hard satisfiability problems
@@ Property / cites work: Generating hard satisfiability problems / rank @@
+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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Differential equations for random processes and random graphs
+Normal rank