Q5111870 (Q5111870): Difference between revisions

@@ Property / cites work @@
+Solving and sampling with many solutions: Satisfiability and other hard problems
+Normal rank
@@ Property / cites work @@
+Improved Pseudorandom Generators for Depth 2 Circuits
+Normal rank
@@ Property / cites work @@
+A short proof for a theorem of Harper about Hamming-spheres
+Normal rank
@@ Property / cites work @@
+-SAT Faster and Simpler---Unique-SAT Bounds for PPSZ Hold in General
+Normal rank
@@ Property / cites work @@
+A fast deterministic algorithm for formulas that have many satisfying assignments
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+A short implicant of a CNF formula with many satisfying assignments
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in less than \(2^ n\) steps
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT
+Normal rank
@@ Property / cites work @@
+A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
+Normal rank