The Complexity of Elementary Problems in Archimedean Ordered Groups
Authors:
Volker Weispfenning
Affiliations:
-
Venue:
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Year:
1985
Citing
0
Cited
1
The complexity of linear problems in fields
Journal of Symbolic Computation
Quantified Score
Hi-index
0.01
Visualization
Abstract