Classes of bounded nondeterminism-Reference-Cited by-同舟云学术

Classes of bounded nondeterminism

Published:1990-12 Issue:1 Volume:23 Page:21-32
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Díaz Josep,Torán Jacobo

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02090764.pdf

Reference24 articles.

1. L. Aldeman: Time, space and randomness. Technical Report MIT/LCS/TM-131, Massachusetts Institute of Technology, 1979.

2. E. Allender: Invertible functions. Ph.D. dissertation, Georgia Institute of Technology, 1985.

3. I. Baker, J. Gill, R. Solovay: Relativization of the P=?NP question.SIAM J. Comput.,4, 1975, 431–442.

4. J. L. Balcázar: En torno a oraculos que ciertas maquinas consultan, y las espantables consecuencias a que ello da lugar. Ph.D. Dissertation, FIB, 1984.

5. J. L. Balcázar, J. Diaz, J. Gabarró:Structural Complexity, Vol. 1. Springer-Verlag, Berlin, 1988.

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The complexity of manipulative attacks in nearly single-peaked electorates;Artificial Intelligence;2014-02

2. Graph Isomorphism is Not AC0-Reducible to Group Isomorphism;ACM Transactions on Computation Theory;2013-11

3. Figure Credits;The Nature of Computation;2011-08-11

4. Copyright Page;The Nature of Computation;2011-08-11

5. Mathematical Tools;The Nature of Computation;2011-08-11