Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6072 LNCS, Issue , 2010, Pages 204-215

  Itsykson, Dmitry ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE-CASE COMPLEXITY; BACKTRACKING ALGORITHM; BINARY INPUTS; EXPANDER GRAPHS; LOWER BOUNDS;

ALGORITHMS; CONSTRAINT THEORY; EXPONENTIAL FUNCTIONS;

COMPUTATION THEORY;

EID: 77954606694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13182-0_19     Document Type: Conference Paper

References (14)

1. Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Pseudorandom generators in propositional proof complexity. In: FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 43. IEEE Computer Society, Los Alamitos (2000)
2. Alekhnovich, M., Hirsch, E.A., Itsykson, D.: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reason. 35(1-3), 51-72 (2005)
3. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. Journal of ACM 48(2), 149-169 (2001)
4. Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich's one-way function candidate and myopic backtracking algorithms. In: Reingold, O. (ed.) Theory of Cryptography. LNCS, vol. 5444, pp. 521-538. Springer, Heidelberg (2009)
5. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394-397 (1962)
6. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201-215 (1960)
7. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. Theory and Applications of Satisfiability Testing, 61-75 (2005)
8. Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
9. Goldreich, O.: Candidate one-way functions based on expander graphs. Technical Report 00-090, Electronic Colloquium on Computational Complexity (2000)
10. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society 43, 439-561 (2006)
11. Mironov, I., Zhang, L.: Applications of SAT solvers to cryptanalysis of hash functions. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 102-115. Springer, Heidelberg (2006)
12. Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences 49, 149-167 (1994)
13. Tseitin, G.S.: On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI 8, 234-259 (1968); English translation of this volume: Consultants Bureau, N.Y., pp. 115-125 (1970)
14. Urquhart, A.: Hard examples for resolution. J. ACM 34(1), 209-219 (1987)