Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hash-based preprocessing and inprocessing techniques in SAT solvers

From MaRDI portal
Publication:2118288
Jump to:navigation, search

DOI10.1007/978-3-030-80223-3_7OpenAlexW3173795160MaRDI QIDQ2118288

Henrik Cao

Publication date: 22 March 2022

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

zbMATH Keywords

hashSATpreprocessingCDCLinprocessing


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)



Uses Software

  • MiniSat
  • MaxPre


Cites Work

  • Unnamed Item
  • Inprocessing Rules
  • Clause Elimination Procedures for CNF Formulas
  • Keyed hash functions
  • Frontiers of Combining Systems
  • Theory and Applications of Satisfiability Testing
  • Theory and Applications of Satisfiability Testing
  • Applications of SAT Solvers to Cryptanalysis of Hash Functions
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2118288&oldid=14617666"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 23:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki