The complexity of linear problems in fields
- 30 April 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 5 (1-2) , 3-27
- https://doi.org/10.1016/s0747-7171(88)80003-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Elimination of quantifiers in algebraic structuresAdvances in Mathematics, 1983
- The complexity of presburger arithmetic with bounded quantifier alternation depthTheoretical Computer Science, 1982
- Complexity of Boolean algebrasTheoretical Computer Science, 1980
- The complexity of logical theoriesTheoretical Computer Science, 1980
- IV. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische AufgabenPublished by Springer Nature ,1976