Split Gröbner Bases for Satisfiability Modulo Finite Fields.
Alex OzdemirShankara PailoorAlp BassaKostas FerlesClark W. BarrettIsil DilligPublished in: IACR Cryptol. ePrint Arch. (2024)
Keyphrases
- numerically stable
- satisfiability problem
- polynomial equations
- np complete
- computational complexity
- terminological reasoning
- methods in computer vision
- numerical stability
- finite number
- propositional logic
- basis functions
- genetic programming
- computer vision
- phase transition
- sat problem
- np hard
- image analysis
- satisfiability testing