Author:
Ben-Or Michael,Kozen Dexter,Reif John
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference15 articles.
1. The complexity of logical theories;Berman;Theoret. Comput. Sci.,1980
2. Fast parallel matrix and gcd computations;Borodin,1982
3. On relating time and space to size and depth;Borodin;SIAM J. Comput.,1977
4. On Euclid's algorithm and the theory of subresultants;Brown;J. Assoc. Comput. Mach.,1971
5. Quantifier elimination for real closed fields by cylindric algebraic decomposition;Collins,1975
Cited by
138 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear stability analysis of chemical mechanism, Listanalchem: A tool for the search of spontaneous mirror symmetry breaking;MethodsX;2023-12
2. The Probabilistic Rabin Tree Theorem*;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Orbit-finite linear programming;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. A First Complete Algorithm for Real Quantifier Elimination in Isabelle/HOL;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11
5. Counting Real Roots in Polynomial-Time via Diophantine Approximation;Foundations of Computational Mathematics;2022-11-28