The Complexity of Almost Linear Diophantine Problems.

Volker Weispfenning

Published in: J. Symb. Comput. (1990)

Keyphrases

decision problems
linear systems
np complete
problems involving
decision trees
computational complexity
computational cost
real time
high dimensional
upper bound
application domains
closed form
solving problems
convex quadratic programming