Acceptance by transformation monoids (with an application to local self reductions)

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 213-224

  Hertrampf, U ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MACHINERY; POLYNOMIAL APPROXIMATION;

COMPLETE SOLUTIONS; K ELEMENTS; MONOIDS; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL-TIME; REDUCTION FUNCTION; SELF-REDUCIBLE SETS; SELF-REDUCTION;

TURING MACHINES;

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

References (25)

1. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity I. Springer, Berlin-Heidelberg-New York, 1988.
2. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity II. Springer, Berlin-Heidelberg-New York, 1990.
3. R. Beigel, J. Gill, and U. Hertrampf. Counting classes: Thresholds, parity, mods, and fewness. In Proceedings 7th Symposium on Theoretical Aspects of Computer Science, volume 415 of Lecture Notes in Computer Science, pages 49-57. Springer, 1990.
4. R. Beigel and H. Straubing. The power of local self-reductions. In Proceedings 10th Structure in Complexity Theory Conference, pages 277-285. IEEE, 1995.
5. D. P. Bovet, P. Crescenzi, and R. Silvestri. Complexity classes and sparse oracles. In Proceedings 6th Structure in Complexity Theory Conference, pages 102-108. IEEE, 1991.
6. D. P. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104: 263-283, 1992.
7. J.-Y. Cai and M. Furst. PSPACE survives constant-width botdenecks. International Journal of Foundations of Computer Science, 2: 67-76, 1991.
8. J.-Y. Cai and L. Hemachandra. On the power of parity polynomial time. In Proceedings 6th Symposium on Theoretical Aspects of Computer Science, volume 349 of Lecture Notes in Computer Science, pages 229-239. Springer, 1989.
9. T. Gundermann, N. Nasser, and G. Wechsung. A survey on counting classes. In Proceedings 5th Structure in Complexity Theory Conference, pages 140-153. IEEE, 1990.
10. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Query order in the polynomial hierarchy. Technical Report TR-634, University of Rochester, Dept. of CS., 1996.
11. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. rf-tt (NP) distinguishes robust many-one and Turing completeness. Technical Report, University of Rochester, Dept. ofCS., 1996.
12. L. Hemaspaandra, H. Hempel, and G. Wechsung. Query order and self-specifying machines. Technical Report No. Math/95/13, Fak. f. Mathematik und Informatik, Friedrich-Schiller-Universitat Jena, Germany, 1995.
13. L. Hemaspaandra and M. Ogihara. Universally serializ-able computation. Technical Report TR-520, University of Rochester, Dept. of CS., 1994.
14. U. Hertrampf. Locally definable acceptance types-the three-valued case. In Proceedings 1st Latin American Symposium on Theoretical Informatics, volume 583 of Lecture Notes in Computer Science, pages 262-271. Springer, 1992.
15. U. Hertrampf. Locally definable acceptance types for polynomial time machines. In Proceedings 9th Symposium on Theoretical Aspects of Computer Science, volume 577 of Lecture Notes in Computer Science, pages 199-207. Springer, 1992.
16. U. Hertrampf. Complexity classes defined via k-valued functions. In Proceedings 9th Structure in Complexity Theory Conference, pages 224-234. IEEE, 1994.
17. U. Hertrampf. Classes of bounded counting type and their inclusion relations. In Proceedings 12th Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 60-70. Springer, 1995.
18. U. Hertrampf. Uber Komplexitatsklassen, die mit Hilfe von fc-wertigen Funktionen definiert werden (On complexity classes, which are defined using fe-valued functions). Habil-itationsschrift, Universitat Wurzburg, Germany, 1995.
19. U. Hertrampf. On the acceptance power of groups and semigroups. Technical Report 96-07, Fachbereich IV-Informatik, Universitat Trier, Germany, 1996.
20. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, and K. Wagner. On the power of polynomial time bit reductions. In Proceedings 8th Structure in Complexity Theory Conference, pages 200-207. IEEE, 1993.
21. M. Ogihara. On serializable languages. International Journal of Foundations of Computer Science, 5: 303-318, 1994.
22. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, Mass., 1994.
23. C. H. Papadimitriou and S. K. Zachos. Two remarks on the complexity of counting. In Proceedings 6th GI Conference on Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, pages 269-276. Springer, 1983.
24. S. Toda. PP is as hard as the polynomial-time hierarchy. S1AM Journal on Computing, 20: 865-877, 1991.
25. N. K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms (in Russian). Izvestija Rossijskoj Akademii Nauk, 57: 51-90, 1993.