Complexity classes without machines: on complete languages for UP

Authors:
J Hartmanis;L Hemachandra
Affiliations:
-;-
Venue:
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Year:
1986

Citing 0
Cited 3

The strong exponential hierarchy collapses

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds for parallel computation on linked structures

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Generic oracles and oracle classes

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract