The complexity of linear problems in fields

Journal of Symbolic Computation

Volumn 5, Issue 1-2, 1988, Pages 3-27

  Weispfenning, Volker ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002355108     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(88)80003-8     Document Type: Article

References (21)

1. The complexity of elementary algebra and geometry
2. Precise bounds for Presburger arithmetic and the reals with addition (preliminary report)
3. The complexity of logical theories
4. Bounds on transfer principles for algebraically closed and complete, discretely vahted fields
5. Quantifier elimination for real closed felds, a guide to the literature
6. Theorem-proving in arithmetic without multiplication
7. A decision procedure for the first order theory of real addition with order
8. The computational complexity of logical theories
9. Super-exponential complexity of Presburger arithmetic
10. The complexity of Presburger arithmetic with bounded quantifier alternation depth
11. Definability and fast quantifier elimination in algebraically closed fields
12. Complexity of Boolean algebras
13. Elimination of quantifiers in algebraic structures
14. Model theoretic methods in the theory of topological fields
15. Presburger arithmetic with bounded quantifier alternation
16. Quantifier elimination for linear formulas over ordered and valued fields
17. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben
18. Aspects of quantifier elimination in algebra
19. Quantifier elimination and decision procedures for valued fields. Proc. Logic Coll. '83
20. The complexity of elementary problems in archimedean ordered groups. Proc. EUROCAL '85 vol. 2