Computing with a full memory: Catalytic space

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2014, Pages 857-866

  Buhrman, Harry ^a   Cleve, Richard ^b   Koucký, Michal ^c   Loff, Bruno ^a   Speelman, Florian ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF WATERLOO   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Arithmetic circuits; Reversible computation; Space complexity; Straight line programs; Transparent computation

Indexed keywords

ARITHMETIC CIRCUIT; REVERSIBLE COMPUTATIONS; SPACE COMPLEXITY; STRAIGHT LINE PROGRAM; TRANSPARENT COMPUTATIONS;

COMPUTATION THEORY;

EID: 84904307579     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591796.2591874     Document Type: Conference Paper

References (28)

1. M. Agrawal, E. Allender, and S. Datta. On TC0, AC0, and arithmetic circuits. Journal of Computer and System Sciences, 60(2):395-421, 2000.
2. E. Allender and M. Koucký. Amplifying lower bounds by means of self-reducibility. J. ACM, 57(3), 2010.
3. E. Allender and M. Ogihara. Relationships among PL, #L, and the determinant. In Proceedings of the Ninth Annual Structure in Complexity Theory Conference, pages 267-278, 1994.
4. T. Baker, J. Gill, and R. Solovay. Relativizations of the P =? NP question. SIAM Journal on Computing, 4(4):431-442, 1975.
5. P. Beame, S. Cook, and H. Hoover. Log depth circuits for division and related problems. SIAM Journal on Computing, 15(4):994-1003, 1986.
6. M. Ben-Or and R. Cleve. Computing algebraic formulas using a constant number of registers. SIAM Journal on Computing, 21(1):54-58, 1992.
7. C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 1973.
8. A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58(1-3):113{136, 1983.
9. J. Boyar, G. Frandsen, and C. Sturtivant. An arithmetic model of computation equivalent to threshold circuits. Theoretical Computer Science, 93(2):303-319, 1992.
10. H. Buhrman, J. Tromp, and P. Vitfianyi. Time and space bounds for reversible simulation. In Proceedings of the 28th ICALP, 2001.
11. R. Cleve. Methodologies for Designing Block Ciphers and Cryptographic Protocols. PhD thesis, University of Toronto, 1989.
12. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985.
13. D. Coppersmith and E. Grossman. Generators for certain alternating groups with applications to cryptography. SIAM Journal on Applied Mathematics, 29(4):624-627, 1975.
14. C. Damm. DET=L(#L). Technical Report Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin, 1991.
15. W. Hesse, E. Allender, and D. A. Mix Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences, 65(4):695-716, 2002.
16. N. Immerman and S. Landau. The complexity of iterated multiplication. Information and Computation, 116(1):103-116, 1995.
17. R. Impagliazzo and R. Paturi. The complexity of k-sat. In Proceedings of the 14th CCC, pages 237-240, 1999.
18. K. J. Lange, P. McKenzie, and A. Tapp. Reversible space equals deterministic space. In Proceedings of the 12th CCC, 1997.
19. J. Reif and S. Tate. On threshold circuits and polynomial computation. SIAM Journal on Computing, 21(5):896-908, 1992.
20. I. H. Sudborough. On the tape complexity of deterministic context-free languages. J. ACM, 25(3):405-414, July 1978.
21. S. Toda. Counting problems computationally equivalent to computing the determinant. Technical Report CSIM, 91-07, 1991.
22. S. Toda. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems, E75-D:116-124, 1992.
23. L. G. Valiant. Completeness classes in algebra. In Proceedings of the eleventh annual ACM symposium on Theory of computing, STOC '79, pages 249-261, New York, NY, USA, 1979. ACM.
24. L. G. Valiant. Why is Boolean complexity theory difficult? In Poceedings of the London Mathematical Society symposium on Boolean function complexity, pages 84-94. Cambridge University Press, 1992.
25. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation of polynomials using few processors. SIAM Journal on Computing, 12(4):641-644, 1983.
26. H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Sciences, 43(2):380-404, 1991.
27. V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pages 270-284, 1991.
28. A. K. Zvonkin and L. A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematics Surveys, 256:83-124, 1970.