EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 4 (1991) RAIRO-Theor. Inf. Appl., 25 4 (1991) 323-354 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 4, 1991
Page(s) 323 - 354
DOI https://doi.org/10.1051/ita/1991250403231
Published online 01 February 2017
  1. 1. L. AUSLANDER, On a problem of Philip Hall, Ann. of Math., 1967, 86(2), pp. 112-116. [MR: 218454] [Zbl: 0149.26904] [Google Scholar]
  2. 2. J. AVENHAUS, K. MADLENER, Subrekursive Komplexität bei Gruppen, I. Gruppen mit vorgeschriebener Komplexität, Acta Inform., 1977, 9, pp. 87-104. [MR: 498062] [Zbl: 0371.02019] [Google Scholar]
  3. 3. J. AVENHAUS, K. MADLENER, Subrekursive Komplexität bei Gruppen, II. Der Einbettungssatz von Higman für entscheidbare Gruppen, Acta Inform., 1978, 9, pp. 183-193. [Zbl: 0371.02020] [Google Scholar]
  4. 4. J. AVENHAUS, K. MADLENER, The Nielson reduction and P-complete problems in free groups, Theoret. Comput. Sci., 1984, 32, pp. 61-76. [Zbl: 0555.20015] [Google Scholar]
  5. 5. J. AVENHAUS, K. MADLENER, On the complexity of intersection and conjugacy problems in free groups, Theoret. Comput. Sci., 1984, pp. 279-295. [Zbl: 0555.20016] [Google Scholar]
  6. 6. D. A. BARRINGTON, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, in: Proc. 18th A.C.M. S.T.O.C., 1986, pp. 1-5. [Google Scholar]
  7. 7. P. W. BEAME, S. A. COOK, H. J. HOOVER, Logdepth circuits for division and related problems, S.I.A.M. J. Comput., 1986, 15 (4), pp. 993-1003. [Zbl: 0619.68047] [Google Scholar]
  8. 8. A. BORODIN, S. A. COOK, N. PIPPENGER, Parallel computation for well-endowed rings and space bounded probabilistic machines, TR # 162/83, University of Toronto. [Zbl: 0598.68043] [Google Scholar]
  9. 9. S. A. COOK, The classification of problems which have fast parallel algorithms, in: Lecture Notes in Comput. Sci., 158, Springer-Verlag, Berlin, 1983. [MR: 734711] [Zbl: 0529.68014] [Google Scholar]
  10. 10. S. A. COOK, A Taxonomy of problems with fast parallel algorithms, Inform. and Control, 1985, 64, pp. 2-22. [MR: 837088] [Zbl: 0575.68045] [Google Scholar]
  11. 11. S. A. COOK, P. MCKENZIE, Problems complete for deterministic logarithmic space, J. Algorithms, 1987, 8, pp. 385-394. [MR: 905994] [Zbl: 0644.68058] [Google Scholar]
  12. 12. S. A. COOK, P. MCKENZIE, The parallel complexity of abelian permutation group problems, S.I.A.M. J. Comput., 1987, 16(2), pp. 880-909. [MR: 908875] [Zbl: 0647.68045] [Google Scholar]
  13. 13. M. J. DUNWOODY, The accessibility of finitely presented groups, Invent. Math., 1985, 81, pp. 449-457. [EuDML: 143267] [MR: 807066] [Zbl: 0572.20025] [Google Scholar]
  14. 14. M. HALL, Subgroups of finite index in free groups, Canad. J. Math., 1949, 1, pp. 187-190. [MR: 28836] [Zbl: 0031.34001] [Google Scholar]
  15. 15.G. H. HARDY, E. M. WRIGHT, An introduction to the theory of numbers, Oxford U. Press, London, 1957. [Zbl: 0058.03301] [JFM: 64.0093.03] [Google Scholar]
  16. 16. J. E. HOPCROFT, J. D. ULLMAN, Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  17. 17. M. KRAUSE, S. WAACK, On oblivious branching programs of linear length, to appear in Inform. and Comput. [MR: 1127534] [Zbl: 0727.68038] [Google Scholar]
  18. 18. K. KRIEGEL, S. WAACK, Lower bounds on the complexity of real-time branching programs, RAIRO Inform. Théor. Appl., 1988, 22 (4), pp. 447-459. [EuDML: 92316] [MR: 984586] [Zbl: 0664.68046] [Google Scholar]
  19. 19. S. LANG, Algebra, Addison-Wesley, Reading 1965. [MR: 197234] [Zbl: 0193.34701] [Google Scholar]
  20. 20. R. J. LIPTON, Polynomials with 0-1 coefficients that are hard to evaluate, in: Proc. 16th Ann. I.E.E.E. Symp. on Foundations of Comp. Sci., 1975, pp. 6-10. [MR: 468316] [Google Scholar]
  21. 21. R. J. LIPTON, Y. ZALCSTEIN, Word problems solvable in logspace, J. of the A.C.M., 1977, 24 (3), pp. 322-526. [MR: 445901] [Zbl: 0359.68049] [Google Scholar]
  22. 22. W. MAGNUS, A. KARASS, D. SOLITAR, Combinatorial group theory, Interscience Publishers, 1966. [Zbl: 0138.25604] [Google Scholar]
  23. 23. A. I. MAL'CEV, On certain classes of infinite solvable groups, Mat. Sb., 1951, 28, pp. 567-598. [MR: 43088] [Google Scholar]
  24. 24. D. MULLER, P. SCHUPP, Groups, the theory of ends, and context-free languages, J. Comput. System Sci., 1983, 26, pp. 295-310. [MR: 710250] [Zbl: 0537.20011] [Google Scholar]
  25. 25. J. E. SAVAGE, The complexity of computing, John Wiley, New York, 1976. [MR: 495205] [Zbl: 0391.68025] [Google Scholar]
  26. 26. H. U. SIMON, Word problems for groups and contextfree recognition, in: Proc. FCT79, Akademie-Verlag, Berlin, 1979. [MR: 563704] [Zbl: 0413.68044] [Google Scholar]
  27. 27. R. G. SWAN, Representations of polycyclic groups, Proc. Amer. Math. Soc., 1967, 18, pp. 573-574. [MR: 213442] [Zbl: 0153.03801] [Google Scholar]
  28. 28. TITS, Free subgroups in linear groups, J. Algebra, 1972, 20, pp. 250-270. [MR: 286898] [Zbl: 0236.20032] [Google Scholar]
  29. 29. C. TRETKOFF, Complexity, combinatorial group theory and the language of pulatators, Theoret. Comput. Sci., 56, 1988, pp. 253-275. [MR: 946201] [Zbl: 0649.20032] [Google Scholar]
  30. 30. S. WAACK, Tape complexity of word problems, in: Proc. FCT'81, Lecture Notes in Comput. Sci., 1981, 117, Springer-Verlag, Berlin, pp. 467-471. [MR: 653014] [Zbl: 0498.03038] [Google Scholar]
  31. 31. S. WAACK, Tape complexity of word problems, TR IMATH der AdW der DDR, Berlin 1981. [MR: 644148] [Zbl: 0468.03021] [Google Scholar]
  32. 32. S. WAACK, Raumkomplexität von Wortproblemen endlicher Gruppenpräsentationen, Dissertation A, Berlin 1983. [Google Scholar]
  33. 33. S. WAACK, The parallel complexity of some constructions in combinatorial group theory, J. Inf. Process. Cybern., 1990, 26, 5/6, pp. 265-281. [MR: 1072920] [Zbl: 0698.68053] [Google Scholar]
  34. 34. I. WEGENER, The complexity of boolean functions, Wiley-Teubner Series in Comput. Sci., 1987. [MR: 905473] [Zbl: 0623.94018] [Google Scholar]
  35. 35. B. A. F. WEHRFRITZ, Infinite linear groups, Springer-Verlag, New York, 1973. [MR: 335656] [Zbl: 0261.20038] [Google Scholar]
  36. 36. O. ZARISKI, P. SAMUEL, Commutative algebra I, II, Van Nostrand, Princton, 1958, 1960. [Zbl: 0081.26501] [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.