3BA: a border bases solver with a SAT extension

DOI10.1007/978-3-319-96418-8_25MaRDI QIDQ1662237zbMATH OpenOpenAlexFDO

Authors Jan Horáček, Martin Kreuzer

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96418-8_25

zbMATH Keywords

SAT solvingBoolean polynomialBoolean border basis algorithmcryptographic attack

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Integrating algebraic and SAT solvers
• Boolean Gröbner bases in SAT solving
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• A signature based border basis algorithm
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• Integrating algebraic and SAT solvers
• 3BA

Describes a project that uses

Uses Software

• LELA
• GBLA
• antom
• ApCoCoA
• PolyBoRi
• FGb

This page was built for publication: 3BA: a border bases solver with a SAT extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662237)