Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Linear Upper Bounds for Random Walk on Small Density Random 3CNFs Mikhail Alekhnovich
 

Summary: Linear Upper Bounds for Random Walk on Small Density Random 3­CNFs
Mikhail Alekhnovich 
Laboratory for Computer Science
MIT
Cambridge, MA
mishka@theory.lcs.mit.edu
Eli Ben­Sasson y
Division of Engineering and Applied Sciences
Harvard University and
Laboratory for Computer Science
MIT
Cambridge, MA.
eli@eecs.harvard.edu.
Abstract
We analyze the efficiency of the random walk algorithm
on random 3­CNF instances, and prove linear upper bounds
on the running time of this algorithm for small clause den­
sity, less than 1:63. Our upper bound matches the observed
running time to within a multiplicative factor. This is the
first sub­exponential upper bound on the running time of a

  

Source: Alekhnovich, Michael - Institute for Advanced Study, Princeton University

 

Collections: Mathematics; Computer Technologies and Information Sciences