Complexity of quantifier elimination in the theory of algebraically closed fields-Reference-Cited by-同舟云学术

Complexity of quantifier elimination in the theory of algebraically closed fields

Published: Issue: Volume: Page:17-31
ISSN:
Container-title:Mathematical Foundations of Computer Science 1984
language:
Short-container-title:

Author:

Chistov A. L.,Grigor'ev D. Yu.

Publisher

Springer-Verlag

Link

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

Reference16 articles.

1. Chistov A.L., Grigor'ev D.Yu. Polynomial-time factoring of the multivariable polynomials over a global field. — LOMI preprint E-5-82, Leningrad, 1982.

2. Chistov A.L., Grigor'ev D.Yu. Subexponential-time solving systems of algebraic equations. I. — LOMI preprint E-9-83, Leningrad, 1983.

3. Chistov A.L., Grigor'ev D.Yu. Subexponential-time solving systems of algebraic equations. II. — LOMI preprint E-10-83, Leningrad, 1983.

4. Chistov A.L., Grigor'ev D.Yu. Polynomial-time factoring of polynomials and subexponential-time solving systems and quantifier elimination. — Notes of Scientific seminars of LOMI, Leningrad, 1984, vol. 137.

5. Collins G.E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. — Lect.Notes Comput.Sci., 1975, vol.33, p. 134–183.

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

1. Digital signature schemes using non-square matrices or scrap automorphisms;International Journal of Computer Mathematics: Computer Systems Theory;2024-01-31

2. Punctually presented structures I: Closure theorems;Computability;2023-12-21

3. Surgical Procedure Understanding, Evaluation, and Interpretation: A Dictionary Factorization Approach;IEEE Transactions on Medical Robotics and Bionics;2022-05

4. Dynamic road crime risk prediction with urban open data;Frontiers of Computer Science;2021-10-19

5. Exploiting low-rank structure in semidefinite programming by approximate operator splitting;Optimization;2020-10-19