Polynomial time certifying algorithms for the planar quantified integer programming problem
From MaRDI portal
Publication:2863168
DOI10.1093/LOGCOM/EXS034zbMATH Open1275.90041OpenAlexW2073611300MaRDI QIDQ2863168
Author name not available (Why is that?)
Publication date: 21 November 2013
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exs034
No records found.
No records found.
This page was built for publication: Polynomial time certifying algorithms for the planar quantified integer programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863168)