Yakov Novikov

According to our database, Yakov Novikov authored at least 9 papers between 2001 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2012

Investigation of simulation-based verification methods for descriptions with functional indeterminacy.

Dmitry Ya. Novikov, Liudmila D. Cheremisinova

Autom. Control. Comput. Sci., 2012

2011

Analysis of the implementability of descriptions with functional indeterminacy based on the verification of conjunctive normal form satisfiability.

Dmitry Ya. Novikov, Liudmila D. Cheremisinova

Autom. Control. Comput. Sci., 2011

2010

Formal verification with functional indeterminacy on the basis of satisfiability testing of the conjunctive normal form.

Liudmila D. Cheremisinova, Dmitry Ya. Novikov

Autom. Control. Comput. Sci., 2010

SAT-based group method for verification of logical descriptions with functional indeterminacy.

Liudmila D. Cheremisinova, Dmitry Ya. Novikov

Proceedings of the 2010 East-West Design & Test Symposium, 2010

2007

BerkMin: A fast and robust Sat-solver.

Eugene Goldberg, Yakov Novikov

Discret. Appl. Math., 2007

2003

How Good Can a Resolution Based SAT-solver Be?

Eugene Goldberg, Yakov Novikov

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Local Search for Boolean Relations on the Basis of Unit Propagation.

Yakov Novikov

Proceedings of the 2003 Design, 2003

Verification of Proofs of Unsatisfiability for CNF Formulas.

Evguenii I. Goldberg, Yakov Novikov

Proceedings of the 2003 Design, 2003

2001

An efficient learning procedure for multiple implication checks.

Yakov Novikov, Evguenii I. Goldberg

Proceedings of the Conference on Design, Automation and Test in Europe, 2001