1 / 12

Amplifying lower bounds by means of self-reducibility

Amplifying lower bounds by means of self-reducibility. Eric Allender Michal Koucký Rutgers University Academy of Sciences Czech Republic. MOD-q. , , MAJ. , , MOD-q. , . Question. ≈ poly-size circuits O(log n )-depth poly-size circuits

Download Presentation

Amplifying lower bounds by means of self-reducibility

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Amplifying lower bounds by means of self-reducibility Eric Allender Michal Koucký Rutgers University Academy of Sciences Czech Republic

  2. MOD-q , , MAJ , , MOD-q ,  Question ≈ poly-size circuits O(log n)-depth poly-size circuits O( 1 )-depth poly-size circuits CC0 AC0 ACC0 TC0 NC1  L  P  NP  PSPACE EXP

  3. Current status Goal: Show SAT  CKT-SIZE( n k ), for all k>1. We have: • explicit f  CKT-SIZE( 4.5 n) • lower-bounds Ω( n 1+d ) • ( formula size Ω( n 3), branching programs Ω( n 2) ) Razborov-Rudich: a natural proof of f  CKT-SIZE(n k )  pseudorandom generators  CKT-SIZE(n k’ )

  4. Our results Thm: Let f be quickly downward self-reducible and C be a usual circuit class. f is in C -SIZE( n k) for some k> 1.  f is in C -SIZE( n 1+) for any  > 0.

  5.  TC0=NC1 Some corollaries: • W5-STCONN  TC0  W5-STCONN  TC0-SIZE( n 1+) for any  > 0. • MAJ  ACC0  MAJ  ACC0-SIZE( n 1+) for any  > 0. W5-STCONN: …  ACC0=TC0

  6. Downward self-reducibility • f is quickly downward self-reducible if for some  > 0 there exists a O(1)-depth and O(n poly-log n)-size circuit family computing fn using -gates, fan-in 2 , -gates and gates computing fn  . • E.g., W5-STCONN: fn n fn fn fn fn n

  7. Thm:W5-STCONN  C-SIZE( n k)  W5-STCONN  C-SIZE( n (k + 1) /2) . Pf: Cn C’n Cn Cn Cn Cn C’n of size (n+1)∙O(n k) + O( n ) = O( n (k + 1) /2) the size of the reduction

  8. Q: To which functions can this be applied? Thm: If A and B are complete for C and A is downward self-reducible then so is B. Thm: Let f have NC1 circuits of depth d ( n ). f TC0-SIZE( 3d ( n ))  NC1  TC0. Thm: If multiplying n matrices of dim. 2log n 2log nover ring ({0,1}, , ) is not in NC1-SIZE ( n 1+) then NC1  NL.

  9. Q: Can this be applied to SAT? Thm: 1) If f is quickly downward self-reducible to fn then f  NC. 2) If f is downward self-reducible to fn  by poly-time computation then f  P. Thm (A. Srinivasan 2008): If computing weak approximations to MAX-CLIQUE cannot be done in det. time n 1+ then P NP.

  10. Natural proofs Razborov-Rudich: • Tn {h :{0,1}n{0,1}} is a natural property if 1) “ f  Tn ?” is decidable in time 2nO(1), and 2) |Tn |>22n /2 n. • { Tn } is a useful property against C if for every function { fn}  { Tn }, f C. Thm [RR’95]: If { Tn } is a natural and useful property against C-SIZE( m) then there are no pseudorandom function generators in C-SIZE( m ).

  11. Natural proofs Example: • Tn= {h :{0,1}n{0,1}, h does not have circuits of depth log*n and size n2 consisting of  and MAJ gates} Claim: { Tn } is natural and useful against TC0-SIZE( n1.5). Q: Is downward self-reducibility natural property? • It is sparse. • It is not really a property as it relates different input sizes !

  12. Challenges • Prove Ω ( n1+ 1/d ) lower bound on size of depth-d circuits computing an explicit function. • Prove Ω ( n2.5 ) lower bound on the length of width-5 branching programs computing an explicit function. Open problems • Are there downward self-reducible function beyond NC1? • Does NP in non-uniform CC0[6]  SAT  CC0[6]-SIZE( n 2) ?

More Related