When satisfiability solving meets symbolic computation
When satisfiability solving meets symbolic computation Page 1 64 COMMUNICATIONS OF
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
Co-certificate learning with SAT modulo symmetries
We present a new SAT-based method for generating all graphs up to isomorphism that
satisfy a given co-NP property. Our method extends the SAT Modulo Symmetry (SMS) …
satisfy a given co-NP property. Our method extends the SAT Modulo Symmetry (SMS) …
A SAT solver and computer algebra attack on the minimum kochen-specker problem
One of the foundational results in quantum mechanics is the Kochen-Specker (KS) theorem,
which states that any theory whose predictions agree with quantum mechanics must be …
which states that any theory whose predictions agree with quantum mechanics must be …
[HTML][HTML] Applying computer algebra systems with SAT solvers to the Williamson conjecture
We employ tools from the fields of symbolic computation and satisfiability checking—namely,
computer algebra systems and SAT solvers—to study the Williamson conjecture from …
computer algebra systems and SAT solvers—to study the Williamson conjecture from …
SAT and lattice reduction for integer factorization
Y Ajani, C Bright - Proceedings of the 2024 International Symposium on …, 2024 - dl.acm.org
The difficulty of factoring large integers into primes is the basis for cryptosystems such as
RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on …
RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on …
Machine learning for SAT solvers
J Liang - 2018 - uwspace.uwaterloo.ca
Boolean SAT solvers are indispensable tools in a variety of domains in computer science
and engineering where efficient search is required. Not only does this relieve the burden on …
and engineering where efficient search is required. Not only does this relieve the burden on …
A nonexistence certificate for projective planes of order ten with weight 15 codewords
C Bright, K Cheung, B Stevens, D Roy… - Applicable Algebra in …, 2020 - Springer
Using techniques from the fields of symbolic computation and satisfiability checking we
verify one of the cases used in the landmark result that projective planes of order ten do not …
verify one of the cases used in the landmark result that projective planes of order ten do not …
[PDF][PDF] A Practical Polynomial Calculus for Arithmetic Circuit Verification.
A Practical Polynomial Calculus for Arithmetic Circuit Verification Page 1 A PRACTICAL
POLYNOMIAL CALCULUS FOR ARITHMETIC CIRCUIT VERIFICATION Daniela Ritirc, Armin …
POLYNOMIAL CALCULUS FOR ARITHMETIC CIRCUIT VERIFICATION Daniela Ritirc, Armin …
Enumeration of complex Golay pairs via programmatic SAT
We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying
that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. This …
that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. This …
[HTML][HTML] Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT
We use techniques from the fields of computer algebra and satisfiability checking to develop
a new algorithm to search for complex Golay pairs. We implement this algorithm and use it to …
a new algorithm to search for complex Golay pairs. We implement this algorithm and use it to …