Non UBC
DSpace
Knop, Alexander
2019-04-05T09:54:33Z
2018-08-31T11:44
Itsykson and Sokolov in 2014 introduced the class of DPLL(xor) algorithms
that solve Boolean satisfiability problem using the splitting by linear
combinations of variables modulo 2. This class extends the class of DPLL
algorithms that split by variables. DPLL(xor) algorithms solve in
polynomial time systems of linear equations modulo 2 that are hard
for DPLL, PPSZ and CDCL algorithms. Itsykson and Sokolov have proved first
exponential lower bounds for DPLL(xor) algorithms on unsatisfiable
formulas. In the talk, we discuss several subclasses of DPLL(xor)
algorithms and explain lower bounds for one of them.
https://circle.library.ubc.ca/rest/handle/2429/69476?expand=metadata
26.0
video/mp4
Author affiliation: UC San Diego
Oaxaca (Mexico : State)
10.14288/1.0377822
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Postdoctoral
BIRS Workshop Lecture Videos (Oaxaca (Mexico : State))
Mathematics
Computer science
Mathematical logic and foundations
Theoretical computer science
Hard Satisfiable Formulas for Splittings by Linear Combinations
Moving Image
http://hdl.handle.net/2429/69476