Degrees and reducibilities of easy tally sets

  • Montserrat Hermo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 841)


The logarithmic advice class, Full-P/log, is known to coincide with the class of languages that are polynomial time reducible to special “easy” tally sets.

We study here how different resource-bounded reducibilities retrieve information encoded in these “easy” sets and we explain the relationships between the reducibilities and the equivalence classes defined from them.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AR1]
    Allender, E., Rubinstein, R.: P-printable Sets. SIAM J. Comput. 17 (1988) 1193–1202Google Scholar
  2. [AW1]
    Allender, E., Watanabe, O.: Kolmogorov Complexity and Degrees of Tally Sets. Information and Computation. 86 (1990) 160–178Google Scholar
  3. [BB1]
    Balcázar, J.L., Book, R.: Sets with Small Generalized Kolmogorov Complexity. Acta Inform. 23 (1986) 679–688Google Scholar
  4. [BDG1]
    Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity II. EATCS Monographs on Theoretical Computer Science. Vol. 22 (1990) Springer-VerlagGoogle Scholar
  5. [BGSS1]
    Balcázar, J.L., Gavaldà, R., Siegelmann, H.T., Sontag, E.D.: Some Structural Complexity Aspects of Neural Computation. In Proceedings of Structural in Complexity Theory 8th Annual Conference. IEEE Computer Society Press (1993) 253–265Google Scholar
  6. [BHM1]
    Balcázar, J.L., Hermo, M., Mayordomo, E.: Characterizations of logarithmic advice complexity classes. In Proceedings of the IFIP 12th World Computer Congress. North-Holland Vol. 1 (1992) 315–321Google Scholar
  7. [BK1]
    Book, R., Ko, K.: On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17 (1988) 903–919Google Scholar
  8. [BS1]
    Balcázar, J.L., Schöning, U.: Logarithmic Advice Classes. Theoretical Computer Science. 99 (1992) 279–290Google Scholar
  9. [H1]
    Hermo, M.: The Structure of a Logarithmic Advice Classes. Report LSI-93-30-R, Facultad de Informática de la UPC (1993)Google Scholar
  10. [HH1]
    Hartmanis, J., Hemachandra, L.: On Sparse Sets Separating Feasible Complexity Classes. Proceedings 3rd Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 210 (1996) 321–333Google Scholar
  11. [KL1]
    Karp, R.M., Lipton, R.J.: Some Connections Between Nonuniform and Uniform Complexity Classes. In Proceedings 12th Annual Symposium on Theory of Computing. (1980) 302–309Google Scholar
  12. [Ko1]
    Ko, K.: Continuous Optimization Problems and Polynomial Hierarchy of Real Functions. J. Complexity. 1 (1985) 210–231Google Scholar
  13. [Ko2]
    Ko, K.: On Helping by Robust Oracle Machines that Take Advice. Theoretical Computer Science. 52 (1987) 15–36Google Scholar
  14. [Kob1]
    Köbler, J.: Untersuchung verschiedener polynomieller Reduktion Klassen von NP. Diplom. thesis, Institut für InformatiK, Univ. Stuttgart. (1985)Google Scholar
  15. [SS1]
    Siegelmann, H.T., Sontag E.D.: Neural Networks with Real Weights: Analog Computational Complexity. Report SYCON 92-05, Rutgers Center for Systems and Control. To appear in Theoretical Computer Science. (1993)Google Scholar
  16. [TB1]
    Tang, S., Book, R.: Reducibilities on Tally and Sparse Sets. Theoretical Informatics and Applications 25-3 (1991) 293–302Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Montserrat Hermo
    • 1
  1. 1.Universidad del Pais Vasco Dept. LSISan SebastianSpain

Personalised recommendations