Arist Kojevnikov

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
New combinatorial complete one-way functions	2013-03-19	Paper
New upper bounds on the Boolean circuit complexity of symmetric functions Information Processing Letters	2010-09-07	Paper
A new approach to proving upper bounds for MAX-2-SAT Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06	2010-08-16	Paper
Circuit complexity and multiplicative complexity of Boolean functions Programs, Proofs, Processes	2010-07-29	Paper
Complexity of semialgebraic proofs with restricted degree of falsity	2009-10-12	Paper
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies Automata, Languages and Programming	2009-03-12	Paper
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities Theory and Applications of Satisfiability Testing – SAT 2007	2009-03-10	Paper
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity Lecture Notes in Computer Science	2007-09-04	Paper
Several notes on the power of Gomory-Chvátal cuts Annals of Pure and Applied Logic	2006-08-16	Paper
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination Annals of Mathematics and Artificial Intelligence	2005-05-13	Paper
scientific article; zbMATH DE number 2084740 (Why is no real title available?)	2004-08-09	Paper

Research outcomes over time

This page was built for person: Arist Kojevnikov