Stepan Kochemazov

Available identifiers

Publication	Date of Publication	Type
Assessing progress in SAT solvers through the Lens of incremental SAT	2022-03-22	Paper
Finding Effective SAT Partitionings Via Black-Box Optimization	2021-09-30	Paper
Improving effectiveness of neighborhood-based algorithms for optimization of costly pseudo-Boolean black-box functions	2021-04-19	Paper
Improving implementation of SAT competitions 2017--2019 winners	2021-04-07	Paper
Black-box optimization in an extended search space for SAT solving	2020-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q5109519	2020-05-12	Paper
Enumerating diagonal Latin squares of order up to 9	2020-01-27	Paper
ALIAS: a modular tool for finding backdoors for SAT	2018-08-10	Paper
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order	2017-09-08	Paper
A volunteer-computing-based grid architecture incorporating idle resources of computational clusters	2017-07-07	Paper
On the construction of triples of diagonal Latin squares of order 10	2017-02-13	Paper

This page was built for person: Stepan Kochemazov