The complexity of disjunctive linear Diophantine constraints
From MaRDI portal
Publication:6303793
DOI10.4230/LIPIcs.MFCS.2018.33zbMath1512.68112arXiv1807.00985MaRDI QIDQ6303793
Marcello Mamino, Barnaby Martin, Manuel Bodirsky, Antoine Mottet
Publication date: 3 July 2018
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: The complexity of disjunctive linear Diophantine constraints