The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844): Difference between revisions

@@ Property / cites work @@
+Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Short proofs are narrow—resolution made simple
@@ Property / cites work: Short proofs are narrow—resolution made simple / rank @@
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of SAT Solvers to Cryptanalysis of Hash Functions
+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 @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Generators in Propositional Proof Complexity
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Randomness conductors and constant-degree lossless expanders
+Normal rank
@@ Property / cites work @@
+Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
+Normal rank