External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Polynomial time certifying algorithms for the planar quantified integer programming problem

Z. Liang, K. Subramani, James Worthington. Polynomial time certifying algorithms for the planar quantified integer programming problem. Journal of Logic and Computation, 23(5):1017-1033, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on