On the resource bounded measure of P/poly

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 182-185

  Kobler J ^a   Lindner, W ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

POLYNOMIAL SIZE; POLYNOMIAL-TIME HIERARCHY; RESOURCE-BOUNDED MEASURE;

COMPUTATIONAL COMPLEXITY;

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

References (22)

1. [AK97] V. ARVIND AND J. KÖBLER. On resource-bounded measure and pseudorandomness. In Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science #1346, 235-249. Springer-Verlag, 1997.
2. [ATZ97] K. AMBOS-SPIES, S. A. TERWIJN, AND X. ZHENG. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172(1-2):195-207, 1997.
3. [BDG90] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ. Structural Complexity II. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
4. [BDG95] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.
5. [BFNW93] L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
6. [BH92] H. BUHRMAN AND S. HOMER. Superpolynomial circuits, almost sparse oracles, and the exponential hierarchy. In Proc. 12th Conference on Foundations of Software Technology and Theoretical Computer Science, 116-127, 1992.
7. [BvMR+98] H. BUHRMAN, D. VAN MELKEBEEK, K. REGAN, D. SIVAKUMAR, AND M. STRAUSS. A generalization of resource-bounded measure, with an application. In Proc. 15th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science #1373, 161-171. Springer-Verlag, 1998.
8. [GL89] O. GOLDREICH AND L. A. LEVIN. A hard-core predicate for all one-way functions. In Proc. 21st ACM Symposium on Theory of Computing. ACM Press, 1989.
9. [GNW95] O. GOLDREICH, N. NISAN, AND A. WIGDERSON. On Yao's XOR-lemma. Technical report, ECCC, 1995.
10. [Kan82] R. KANNAN. Circuit-size lower bounds and nonreducibility to sparse sets. Information and Control, 55:40-56, 1982.
11. [KL80] R. M. KARP AND R. J. LIPTON. Some connections between nonuniform and uniform complexity classes. In Proc. 12th ACM Symposium on Theory of Computing, 302-309. ACM Press, 1980.
12. [KW95] J. KÖBLER AND O. WATANABE. New collapse consequences of NP having small circuits. In Proc. 22nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science #944, 196-207. Springer-Verlag, 1995.
13. [Lip91] R. J. LIPTON. New directions in testing. In J. Feigenbaum and M. Merritt, editors, Distributed Computing and Cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science #2. American Mathematical Society, 1991.
14. [Lub97] M. LUBY. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1997.
15. [Lut92] J. H. LUTZ. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
16. [Lut96] J. H. LUTZ. Observations on measure and lowness for P2. In Proc. 13th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science #1046, 87-97. Springer-Verlag, 1996.
17. [May94] E. MAYORDOMO. Contributions to the Study of Resource Bounded Measure. PhD thesis, Universitat Politècnica de Catalunya, Barcelona, 1994.
18. [NW94] N. NISAN AND A. WIGDERSON. Hardness vs randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
19. [Pap94] C. PAPADIMITRIOU. Computational Complexity. Addison-Wesley, 1994.
20. [RSC95] K.W. REGAN, D. SIVAKUMAR, AND JIN-YI CAI. Pseudorandom generators, measure theory, and natural proofs. In Proc. 36th IEEE Symposium on the Foundations of Computer Science. IEEE Computer Society Press, 1995.
21. [Sto85] L. STOCKMEYER. On approximation algorithms for #P. SIAM Journal on Computing, 14(4):849-861, 1985.
22. [Yao82] A. C. YAO. Theory and applications of trapdoor functions. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science, 80-91. IEEE Computer Society Press, 1982.