The structure of logarithmic advice complexity classes

Theoretical Computer Science

Volumn 207, Issue 1, 1998, Pages 217-244

  Balcázar, José L ^a   Hermo, Montserrat ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242723969     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00066-8     Document Type: Article

References (28)

1. E. Allender, L. Hemachandra, Lower bounds for the low hierarchy, J. Assoc. Comput. Mach. 39 (1) (1992) 234-250.
2. E. Allender, L. Hemachandra, M. Ogiwara, O. Watanabe, Relating equivalence and reducibility to sparse sets, SIAM J. Comput. 21 (3) (1992) 521-539.
3. E. Allender, O. Watanabe, Kolmogorov complexity and degrees of tally sets, Inform. Comput. 86 (2) (1990) 160-178.
4. V. Arvind, Y. Han, L. Hemachandra, J. Koebler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, T. Thierauf, Reductions to sets of low information content, in: K. Ambos-Spies, S. Homer, U. Schöning, (Eds.), Complexity Theory, Cambridge University Press, Cambridge, 1993, pp. 1-6.
5. V. Arvind, J. Köbler, M. Mundhenk, Upper bounds on the complexity of sparse and tally descriptions, Math. Systems Theory 29 (1) 1996, 63-94.
6. A. Atserias, J. Balcázar, Refining logical characterizations of advice complexity classes, in: (A. Kakas, A Synachopoulos (Eds.), Proc. 1st PanHellenic Symp. on Logic, Cyprus University, 1997, pp. 157-169.
7. J. Balcázar, R. Book, U. Schöning, Sparse sets, lowness, and highness, SIAM J. Comput. 15 (3) (1986) 739-747.
8. J. Balcázar, H. Buhrman, M. Hermo, Learnability of Kolmogorov-easy circuit expression via queries, in: Computational Learning Theory, Proc. Eurocolt'95, vol. 904, Lecture Notes in Artificial Intelligence. Springer, Berlin, 1995, pp. 112-124.
9. J. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I, 2nd ed. Texts in Theoretical Computer Science, Springer, Berlin, 1995.
10. J. Balcázar, R. Gavaldà, H. Siegelmann, Computational power of neural networks: a characterization in terms of Kolmogorov complexity, IEEE Trans. Inform. Theory 43 (4) (1997) 1175-1183.
11. J. Balcázar, M. Hermo, E. Mayordomo, Characterizations of logarithmic advice complexity classes, in: Proc. IFIP 12th World Computer Congr., vol. 1, North-Holland, Amsterdam, 1992, pp. 315-321.
12. J. Balcázar, U. Schöning, Logarithmic advice classes, Theor. Comput. Sci. 99 (1992) 279-290.
13. R. Book, K. Ko, On sets truth-table reducible to sparse sets, SIAM J. Comput. 17 (5) (1988) 903-919.
14. k, Inform. Théor. Appl. 30 (2) (1996) 101-121.
15. J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computations, in: Proc. 24th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, California, 1983, pp. 439-445.
16. M. Hermo, Degrees and reducibilities of easy tally sets, in: Proc. 19th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 1994, pp. 403-412.
17. M. Hermo, Nonuniform Complexity Classes with Sub-Linear Advice Functions, PhD. Thesis, Universidad del País Vasco, 1996.
18. R. Karp, R. Lipton, Some connections between nonuniform and uniform complexity classes, in: Proc. 12th ACM Symp. on Theory of Computing, 1980, pp. 302-309.
19. K. Ko, On the notion of infinite pseudorandom sequences, Theor. Comput. Sci. 48 (1986) 9-13.
20. K. Ko, On helping by robust oracle machines, Theor. Comput. Sci. 52 (1987) 15-36.
21. J. Koebler, U. Schöning, K. Wagner, The difference and truth-table hierarchy for NP, Inform. Théor. Appl. 21 (4) (1987) 419-435.
22. T. Long, M. Sheu, A refinement of the low and high hierarchies, Math. Systems Theory 28 (4) (1995) 299-327.
23. S. Mahaney, Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, J. Comput. System Sci., 25 (1982) 130-143.
24. P. Orponen, K. Ko, U. Schöning, O. Watanabe, Instance complexity, J. Assoc. Comput. Mach. 41 (1994) 96-122.
25. H. Siegelmann, E. Sontag, Analog computation via neural networks, Theor. Comput. Sci. 131 (1994) 331-360.
26. M. Sipser, A complexity-theoretic approach to randomness, in: Proc. 15th ACM Symp. on Theory of Computing, 1983, pp. 330-335.
27. S. Tang, R. Book, Reducibilities on tally and sparse sets, Inform. Théor. Appl. 25 (3) (1991) 293-302.
28. K. Wagner, Bounded query classes, SIAM J. Comput. 19 (5) (1990) 833-846.