By Topic

Amplifying Lower Bounds by Means of Self-Reducibility

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Allender, E. ; Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ ; Koucky, M.

We observe that many important computational problems in NC1 share a simple self-reducibility property. We then show that, for any problem A having this self-reducibility property, A has polynomial size TC0 circuits if and only if it has TC0 circuits of size n1+isin for every isin>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 NC1. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE requires depth d TC0 circuits of size n1+isin d. If one were able to improve this lower bound to show that there is some constant isin>0 such that every TC0 circuit family recognizing BFE has size n1+isin, then it would follow that TC0neNC1. 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 d TC0 and AC0 [6] circuits of size n1+c for some constant c depending on d.

Published in:

Computational Complexity, 2008. CCC '08. 23rd Annual IEEE Conference on

Date of Conference:

23-26 June 2008