To access the full text documents, please follow this link: http://hdl.handle.net/2117/103872

Trade-offs between time and memory in a tighter model of CDCL SAT solvers
Elffers, J.; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc
Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
Conflict-Driven Clause Learning
Commerce
Formal logic
Clause learning
Fine grained
Learning schemes
Lower bounds
Memory usage
Resolution proofs
SAT solvers
Upper Bound
Economic and social effects
Aprenentatge basat en conflictes
info:eu-repo/semantics/submittedVersion
info:eu-repo/semantics/conferenceObject
         

Show full item record

Related documents

Other documents of the same author

Atserias, Albert; Lauria, Massimo; Nordström, Jakob
Atserias, Albert; Lauria, Massimo; Nordström, Jakob
 

Coordination

 

Supporters