EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 26 / No 4 (1992) RAIRO-Theor. Inf. Appl., 26 4 (1992) 345-362 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 26, Number 4, 1992
Page(s) 345 - 362
DOI https://doi.org/10.1051/ita/1992260403451
Published online 01 February 2017
  1. [AM86] N. ALON and W. MAASS, Meanders, Ramsey Theory and Lower Bounds, Proc. 27th I.E.E.E. FOCS 410-417, 1986. [Google Scholar]
  2. [Im87] N. IMMERMAN, Nondeterministic Space is Closed Under Complement, Techn. Report 552, Yale Univ., 1987. [MR: 961049] [Google Scholar]
  3. [KL80] R. M. KARP and R. J. LIPTON, Some Connections Between Nonuniform and Uniform Complexity Classes, Proc. 12th A.C.M. Symp. on Theory of Computing, 302-309 1980. [Google Scholar]
  4. [KMW91] M. KRAUSE, Ch. MEINEL and S. WAACK, Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe, Theoret. Comput. Sci., 1991, 86, pp. 267-275. [MR: 1122791] [Zbl: 0749.68036] [Google Scholar]
  5. [Kr91] M. KRAUSE, Lower Bounds for Depth-Restricted Branching programs, Inform. and Comput., 1991, 91, pp. 1-14. [MR: 1097261] [Zbl: 0800.68495] [Google Scholar]
  6. [KW91] M. KRAUSE and S. WAACK, On Oblivious Branching Programs of Linear Length, Inform. and Comput., 1991, 94, pp. 232-249. [MR: 1127534] [Zbl: 0727.68038] [Google Scholar]
  7. [Me86] Ch. MEINEL, p-Projection Reducibility and the Complexity Classes L (Nonuniform) and NL (Nonuniform), Proc. 12th MFCS, Bratislava, LNCS 233, pp.527-535; revised and extended version in EIK, 1987, 23, 10/11, pp. 545-558. [MR: 935269] [Zbl: 0611.03021] [Google Scholar]
  8. [Me88] Ch. MEINEL, The Power of Polynomial Size Ω-Branching Programs, Proc. STAC'88, Bordeaux, L.N.C.S. n° 294, pp. 81-90. [MR: 935789] [Zbl: 0644.68074] [Google Scholar]
  9. [Ru81] W. Ruzzo, On Uniform Circuit Complexity, J. Comput. System Sci., 1981, 22, (3), pp. 236-283. [MR: 633540] [Zbl: 0462.68013] [Google Scholar]
  10. [SV81] S. SKYUM and L. VALIANT, A Complexity Theory Based on Boolean Algebra, Proc. 22th LE.E.E. F.O.C.S., 1981, pp. 244-253. [Google Scholar]
  11. [Sz87] R. SZELEPCSENYI, The Method of Forcing for Nondeterministic Automata, Bulletin of the E.A.T.C.S., 1987, 33, pp. 96-99. [Zbl: 0664.68082] [Google Scholar]
  12. [We87] I. WEGENER, The Complexity of Boolean Functions, Teubner, Stuttgart, 1987. [MR: 905473] [Zbl: 0623.94018] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.