The complexity of linear problems in fields
Journal of Symbolic Computation
The complexity of almost linear diophantine problems
Journal of Symbolic Computation
A new algebraic method for robot motion planning and real geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
Counting and equality constraints for multitree automata
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Weak integer quantifier elimination beyond the linear case
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |