加载中…
2018-07-03
The complexity of disjunctive linear Diophantine constraints
Manuel BodirskyBarnaby MartinMarcello MaminoAntoine Mottet
文献摘要
We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本