On the Satisfiability of Modular Arithmetic Formulae

DOI10.1007/11901914_16zbMath1161.68496OpenAlexW1581189074MaRDI QIDQ3522909

Bow-Yaw Wang

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• SLAM
• SYMPHONY

This page was built for publication: On the Satisfiability of Modular Arithmetic Formulae