On digital nondeterminism-Reference-Cited by-同舟云学术

On digital nondeterminism

Published:1996-12 Issue:6 Volume:29 Page:635-647
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Cucker F.,Matamala M.

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/BF01301968.pdf

Reference18 articles.

1. J. L. Balcázar, J. Díaz, and J. Gabarró.Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11. Springer-Verlag, 1988.

2. E. Bienenstock, F. Fogelman-Soulie, and G. Weisbuch, eds.Disordered Systems and Biological Organization. NATO ASI, Series F: Computer and System Sciences. Springer-Verlag, 1986.

3. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines.Bulletin of the American Mathematical Society, 21(1): 1–46, 1989.

4. F. Cucker. Pℝ ≠ NCℝ.Journal of Complexity, 8:230–238, 1992.

5. F. Cucker. On the complexity of quantifier elimination: The structural approach.The Computer Journal, 36(5):400–408, 1993.

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

1. Generalization of the Subset Sum Problem and Cubic Forms;Computational Mathematics and Mathematical Physics;2023-01

2. Generalization of the Subset Sum Problem and Cubic Forms;Журнал вычислительной математики и математической физики;2023-01-01

3. ON COMPUTATIONS OVER ORDERED RINGS;SIB ELECTRON MATH RE;2022

4. Computational Complexity of Multi-player Evolutionarily Stable Strategies;Computer Science – Theory and Applications;2021

5. The PCP Theorem for NP Over the Reals;Foundations of Computational Mathematics;2014-03-28