The Complexity of Almost Linear Diophantine Problems

Volker Weispfenning. The Complexity of Almost Linear Diophantine Problems. Journal of Symbolic Computation, 10(5):395-404, 1990.

@article{Weispfenning90,
  title = {The Complexity of Almost Linear Diophantine Problems},
  author = {Volker Weispfenning},
  year = {1990},
  researchr = {https://researchr.org/publication/Weispfenning90},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Computation},
  volume = {10},
  number = {5},
  pages = {395-404},
}