Some new effectivity bounds in computational geometry
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 131-151
- https://doi.org/10.1007/3-540-51083-4_54
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Sharp Effective NullstellensatzJournal of the American Mathematical Society, 1988
- The complexity of linear problems in fieldsJournal of Symbolic Computation, 1988
- Local Diophantine Nullstellen InequalitiesJournal of the American Mathematical Society, 1988
- Bounds for the Degrees in the NullstellensatzAnnals of Mathematics, 1987
- THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDSMathematics of the USSR-Izvestiya, 1987
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- An efficient quantifier elimination algorithm for algebraically closed fields of any characteristicACM SIGSAM Bulletin, 1975
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970