NDLI: Amplifying lower bounds by means of self-reducibility

Content Provider	ACM Digital Library
Author	Allender, Eric Kouck, Michal
Copyright Year	2010
Abstract	We observe that many important computational problems in $NC^{1}$ share a simple self-reducibility property. We then show that, for any problem $\textit{A}$ having this self-reducibility property, $\textit{A}$ has polynomial-size $TC^{0}$ circuits if and only if it has $TC^{0}$ circuits of size $n^{1+&epsis;}$ for every &epsis;> 0 (counting the number of wires in a circuit as the size of the circuit). As an example of what this observation yields, consider the Boolean Formula Evaluation problem (BFE), which is complete for $NC^{1}$ and has the self-reducibility property. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE requires depth $\textit{d}$ $TC^{0}$ circuits of size $n^{1+&epsis;_{d}}.$ If one were able to improve this lower bound to show that there is some constant &epsis;> 0 (independent of the depth $\textit{d})$ such that every $TC^{0}$ circuit family recognizing BFE has size at least $n^{1+&epsis;},$ then it would follow that $TC^{0}$ ≠ $NC^{1}.$ We show that proving lower bounds of the form $n^{1+&epsis;}$ is not ruled out by the Natural Proof framework of Razborov and Rudich and hence there is currently no known barrier for separating classes such as $ACC^{0},$ $TC^{0}$ and $NC^{1}$ via existing “natural” approaches to proving circuit lower bounds. We also show that problems with small uniform constant-depth circuits have algorithms that simultaneously have small space and time bounds. We then make use of known time-space tradeoff lower bounds to show that SAT requires uniform depth $\textit{d}$ $TC^{0}$ and $AC^{0}[6]$ circuits of size $n^{1+c}$ for some constant $\textit{c}$ depending on $\textit{d}.$
Starting Page	1
Ending Page	36
Page Count	36
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/1706591.1706594
Journal	Journal of the ACM (JACM)
Volume Number	57
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Circuit complexity Lower bounds Natural proofs Self-reducibility Time-space tradeoffs
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Time-space lower bounds for satisfiability

Nonuniform ACC Circuit Lower Bounds

Amplifying Lower Bounds by Means of Self-Reducibility

On the space complexity of randomized synchronization

Instance complexity

Amplifying Lower Bounds by Means of Self-Reducibility (2010)

Quantum lower bounds by polynomials

Polylogarithmic independence fools $AC^{0}$ circuits

Space-time tradeoffs for approximate nearest neighbor searching

Amplifying lower bounds by means of self-reducibility

Similar Documents

Time-space lower bounds for satisfiability

Nonuniform ACC Circuit Lower Bounds

Amplifying Lower Bounds by Means of Self-Reducibility

On the space complexity of randomized synchronization

Instance complexity

Amplifying Lower Bounds by Means of Self-Reducibility (2010)

Quantum lower bounds by polynomials

Polylogarithmic independence fools $AC^{0}$ circuits

Space-time tradeoffs for approximate nearest neighbor searching

Amplifying lower bounds by means of self-reducibility