November 01, 1996 article Open access On the combinatorial and algebraic complexity of quantifier elimination Journal of the ACM DOI: 10.1145/235809.235813 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 328 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Implementing arithmetic over algebraic numbers A tutorial for Lazard's lifting scheme in CAD 2021 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Polynomial and algebraic computation 1 citations 1 result References 0