Abstract
This paper contains some first steps towards a theory of complexity in the area of computations on more general data structures. Special structures are studied which show a highly pathological behaviour as regards complexity theory. Then we define what it means for a structure to be well-designed and treat examples of such structures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Braun,H. (1986) Komplexität von Berechnungen auf der Datenstruktur der binären Wörter mit Konkatenation, Interner Bericht der Fakultät für Informatik der Universität Karlsruhe
Blass, A., Gurevich, Y. (1984) Equivalence relations, invariants and normal forms, In:E. Börger, G. Hasenjaeger, D. Rödding (eds), Logic and Machines: Decision Problems and Complexity, LNCS 171, Springer, Berlin Heidelberg New York, pp.24–42
Berman, P., Halpern, J.Y., Tiuryn, J. (1982) On the power of non-determinism in Dynamic Logic, In: Proceedings, Ninth Colloquium on Automata, Languages and Programming 82, LNCS 140, Springer, Berlin Heidelberg New York, pp. 48–60
Harel, D. (1984) Dynamic Logic, In: D. Gabbey & F. Guenther (eds), Handbook of Philosophical Logic, Reidel Publishing, Dordrecht, pp. 496–604
Hawrusik,F., Venkatamaran,K.N., Yasuhara,A. (1981) Classes of functions for computing on binary trees, STOC, pp. 19–27
Kfoury,A.J., Urzyczyn,P. (1985) Necessary and sufficient conditions for the universality of programming formalisms, Acta Informatica, Vol. 22(4)
Kfoury,A.J. (1983) Definability by programs in first-order structures, Theoretical Computer Science 25, pp. 1–66
Matchey,M., Young,P. (1978) An introduction to the general theory of algorithms, North-Holland
Sperschneider,V. (1985) Halbsymbolisches Rechnen als methodisches Werkzeug in der Komplexitätstheorie auf Datenstrukturen, Habilitationsschrift, Universität Karlsruhe
Stolboushkin, A.P., Taitslin, M.A. (1983) Deterministic Dynamic Logic is strictly weaker than Dynamic Logic, Information and Control, Vol. 57, pp. 48–55
Stolboushkin, A.P. (1983) Regular Dynamic Logic is not interpretable in deterministic context-free Dynamic Logic, Information and Control, vol. 57, pp. 48–55
Tiuryn,J. (1986) A simplified proof of DDL<DL, To appear in Information and Control
Urzyczyn,P. (1981) The unwind property in certain algebras, Information and Control, Vol. 50
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sperschneider, V. (1987). First steps towards a theory of complexity over more general data structures. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_181
Download citation
DOI: https://doi.org/10.1007/3-540-18170-9_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18170-5
Online ISBN: 978-3-540-47795-2
eBook Packages: Springer Book Archive