Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aleliunas,R., R.M.Karp, R.J.Lipton, L.Lovasz, C.Rackoff: Random walks, universal traversal sequences, and the complexity of maze problems. Proc 20-th FOCS, 1979, pp. 218–223
Borodin, A.: On relating time and space to size and depth. SIAM J. Comp. 6(1977), pp. 733–744
Budach,L.: Klassifizierungsprobleme und das Verhältnis von deterministischer und nichtdeterministischer Raumkompliziertheit. Sem.Ber. Nr. 68, Sektion Mathematik, Humboldt-Univ. Berlin, 1985
Chandra, A.K., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. Comp. 13, No 2 (1984), pp. 423–439
Cook,S.A.: Towards a complexity theory of synchronous parallel algorithms. Univ. of Toronto, Techn. Rep. 164/83
Cook, S.A.: The classification of Problems which have fast parallel computation. L'Enseignement Math. XXVII (1981), pp. 99–124
Furst,M., J.D. Saxe, M. Sipser: Parity, circuits and the polynomial-time hierarchy. Proc. 22-th FOCS, 1981, pp. 260–270
Meinel,Ch.: l (nonuniform) and nl (nonuniform). Preprint, Sektion Mathematik, Humboldt-Univ. Berlin, 1986
Paul,W.: Komplexitätstheorie. Teubner Studienbücherei Inf., 1978
Savitch, W.: Relations between nondeterministic and deterministic tape complexities. J.Comp. and Sys.Sc. 4 (1970), pp.177–192
Skyum,S., L.G.Valiant: A complexity theory based on Boolean algebra. Proc. 22-th FOCS, 1981, pp.244–253
Yao,A.: Separating the poynomial-time hierarchy by oracles. 26thFOCS
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meinel, C. (1986). p-Projection reducibility and the complexity classes ℒ (nonuniform) and Nℒ (nonuniform). In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016279
Download citation
DOI: https://doi.org/10.1007/BFb0016279
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive