Exact Results in Quantum Theory
sala 1.40, ul. Pasteura 5
Grzegorz Łach (IFT UW)
"Principle of the conservation of effort" and how to bypass it
During last decade it has been shown that huge variety of computational problems can be (exactly) rewritten as boolean satisfiability problems (so called SAT or #SAT problems) to which very efficient computational tools (aka SAT-solvers) exist.