Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms

We prove an exponential lower bound on the average time of inverting Goldreich’s function by drunken backtracking algorithms; this resolves the open question stated in Cook et al. (Proceedings of TCC, pp. 521–538, 2009 ). The Goldreich’s function has n binary inputs and n binary outputs. Every outpu...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 54; no. 2; pp. 261 - 276
Main Author:	Itsykson, Dmitry
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2014 Springer Nature B.V
Subjects:	Algorithms Analysis Backtracking Computer Science Heuristic Studies Theory of Computation Variables Lower bound Expander DPLL Goldreich’s function
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!