An NP-Complete Number-Theoretic Problem

Authors:
Eitan M. Gurari;Oscar H. Ibarra
Affiliations:
Department of Computer Science, University of Minnesota, Minneapolis, MN;Department of Computer Science, University of Minnesota, Minneapolis, MN
Venue:
Journal of the ACM (JACM)
Year:
1979

Citing 3
Cited 4

Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
NP-complete decision problems for quadratic polynomials

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

The complexity of almost linear diophantine problems

Journal of Symbolic Computation
Complexity and uniformity of elimination in Presburger arithmetic

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Two-Way Counter Machines and Diophantine Equations

Journal of the ACM (JACM)
Counter machines and verification Problems

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract