Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Proving Lower Bounds via Pseudo-Random Manindra Agrawal

Summary: Proving Lower Bounds via Pseudo-Random
Manindra Agrawal
Department of Computer Science
Indian Institute of Technology, Kanpur
Abstract. In this paper, we formalize two stepwise approaches, based
on pseudo-random generators, for proving P = NP and its arithmetic
analog: Permanent requires superpolynomial sized arithmetic circuits.
1 Introduction
The central aim of complexity theory is to prove lower bounds on the complexity
of problems. While the relative classification of problems (via reductions) has
been very successful, not much progress has been made in determining their
absolute complexity. For example, we do not even know if NE admits nonuniform
Initial attempts (in 1970s) to prove lower bounds centered on using the diag-
onalization technique that had proven very useful in recursion theory. However,
a series of relativization results soon showed that this technique cannot help in
its standard guise [6]. Very recently, the technique has been used to prove cer-


Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur


Collections: Computer Technologies and Information Sciences