Investigating the existence of Costas Latin squares via satisfiability testing

DOI10.1007/978-3-030-80223-3_19OpenAlexW3194263424MaRDI QIDQ2118308

Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang, Jiwei Jin

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial designs with Costas arrays properties
• Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
• Packing Costas Arrays
• Finding orthogonal latin squares using finite model searching tools
• Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing

Related Items (1)

Unnamed Item

Uses Software

• MathCheck

This page was built for publication: Investigating the existence of Costas Latin squares via satisfiability testing