"Polynomial time certifying algorithms for the planar quantified integer ..."

Z. Liang, K. Subramani, James Worthington (2013)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXS034

access: closed

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/LiangSW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/LiangSW13
Z. Liang, K. Subramani, James Worthington:
Polynomial time certifying algorithms for the planar quantified integer programming problem. J. Log. Comput. 23(5): 1017-1033 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.