Travelled to:
1 × France
1 × Italy
2 × Germany
Collaborated with:
E.I.Goldberg ∅ E.Goldberg
Talks about:
solver (2) sat (2) unsatisfi (1) procedur (1) resolut (1) multipl (1) formula (1) boolean (1) search (1) robust (1)
Person: Yakov Novikov
DBLP: Novikov:Yakov
Contributed to:
Wrote 5 papers:
- DATE-2003-GoldbergN #proving #satisfiability #verification
- Verification of Proofs of Unsatisfiability for CNF Formulas (EIG, YN), pp. 10886–10891.
- DATE-2003-Novikov
- Local Search for Boolean Relations on the Basis of Unit Propagation (YN), pp. 10810–10815.
- SAT-2003-GoldbergN #how #question
- How Good Can a Resolution Based SAT-solver Be? (EG, YN), pp. 37–52.
- DATE-2002-GoldbergN #named #performance #robust
- BerkMin: A Fast and Robust Sat-Solver (EIG, YN), pp. 142–149.
- DATE-2001-NovikovG #learning #multi #performance
- An efficient learning procedure for multiple implication checks (YN, EIG), pp. 127–135.