Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

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

Volumn 5444 LNCS, Issue , 2009, Pages 521-538

  Cook, James ^a   Etesami, Omid ^a   Miller, Rachel ^b   Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHM; BIT-STRINGS; CONSTRAINT SATISFACTION PROBLEMS; EXPERIMENTAL ANALYSIS; GAUSSIAN ELIMINATION; GENERAL CLASS; LOWER BOUNDS; NON-LINEAR; ONE-WAY FUNCTIONS; PARAMETERIZED; RANDOM GRAPHS; RUNNING TIME; SAT SOLVERS; SMALL INPUTS;

AGRICULTURE; CONTROL THEORY; CRYPTOGRAPHY; EQUIVALENCE CLASSES; EXPERIMENTS; LABELING;

GRAPH THEORY;

EID: 70350681135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_31     Document Type: Conference Paper

References (13)

1. Achlioptas, D., Sorkin, G.B.: Optimal myopic algorithms for random 3-SAT. In: FOCS, pp. 590-600 (2000)
2. Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Pseudorandom generators in propositional proof complexity. SIAM Journal on Computing 34(1), 67-88 (2004)
3. Alekhnovich, M., Hirsch, E.A., Itsykson, D.: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reasoning 35, 51-72 (2005)
4. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. on Computing 36(4), 845-888 (2006)
5. Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in NC0 . In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 260-271. Springer, Heidelberg (2006)
6. Ben-Sasson, Wigderson: Short proofs are narrow-resolution made simple. J. ACM: Journal of the ACM 48 (2001)
7. Cryan, M., Miltersen, P.B.: On pseudorandom generators in NC. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, p. 272. Springer, Heidelberg (2001)
8. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394-397 (1962)
9. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005)
10. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
11. Goldreich, O.: Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(90) (2000)
12. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201-215 (1960)
13. Mossel, E., Shpilka, A., Trevisan, L.: On -biased generators in NC0. Random Structures and Algorithms 29(1), 56-81 (2006)