Another Basis for the W-Hierarchy and the Tradeoff Theorem
We give a uniform circuit basis for the W-hierarchy. We introduce the syntactic classes G[t] and prove the Replacement and Tradeoff Theorems. These lead to evidence that the W-hierarchy is proper and give a different perspective on its naturality.
KeywordsVertex Cover Existential Quantification Programmable Logic Array Existential Formula Present Chapter
- 106.R. Boppana, M. Sipser, The complexity of finite functions, in Handbook of Theoretical Computer Science, vol. A, ed. by J. van Leeuwen (MIT Press, Cambridge, 1990), pp. 757–804 Google Scholar
- 620.M. Sipser, A complexity theoretic approach to randomness, in Proceedings of 15th ACM Symposium on Theory of Computing (STOC ’83), Boston, Massachusetts, USA, May 25–May 27, 1983, ed. by D. Johnson, et al. (ACM, New York, 1983), pp. 330–335 Google Scholar