Distinguishing SAT from polynomial-size circuits, through black-box queries

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 88-95

  Atserias, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS;

BLACK BOX QUERIES; BOOLEAN CIRCUITS; BOOLEAN FORMULA; POLYNOMIAL SIZE CIRCUITS;

LOGIC CIRCUITS;

EID: 34247487056     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.17     Document Type: Conference Paper

References (9)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, second edition, 1996.
2. A. Bogdanov and L. Trevisan. On worst-case to average-case reductions for NP problems. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
3. N. H. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:421-423, 1996.
4. J. Feigenbaum and L. Fortnow. On the random-self-reducibility of complete sets. SIAM Journal of Computing, 22:994-1005, 1993.
5. L. Fortnow, A. Pavan, and S. Sengupta. Proving SAT does not have Small Circuits with an Application to the Two-Queries Problem. In 18th IEEE Conference on Computational Complexity, pages 347-357, 2003.
6. D. Gutfreund, R. Shaltiel, and A. Ta-Shma. If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. In 20th IEEE Conference on Computational Complexity, pages 243-257, 2005.
7. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences, 62(2):236-252, 2001. A preliminary version appeared in CCC 2000.
8. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1995.
9. E. Viola. The complexity of constructing pseudorandom generators from hard functions. Journal of Computational Complexity, 13(3-4): 147-188, 2004. A prelinary version appeared in CCC 2003 under the title 'Hardness vs. Randomness within Alternating Time'.