Arist Kojevnikov

From MaRDI portal
Person:1777394

Available identifiers

zbMath Open kojevnikov.aristMaRDI QIDQ1777394

List of research outcomes





PublicationDate of PublicationType
New combinatorial complete one-way functions2013-03-19Paper
New upper bounds on the Boolean circuit complexity of symmetric functions2010-09-07Paper
A new approach to proving upper bounds for MAX-2-SAT2010-08-16Paper
Circuit complexity and multiplicative complexity of Boolean functions2010-07-29Paper
Complexity of semialgebraic proofs with restricted degree of falsity2009-10-12Paper
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies2009-03-12Paper
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities2009-03-10Paper
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity2007-09-04Paper
Several notes on the power of Gomory-Chvátal cuts2006-08-16Paper
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination2005-05-13Paper
https://portal.mardi4nfdi.de/entity/Q44756712004-08-09Paper

Research outcomes over time

This page was built for person: Arist Kojevnikov

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1777394&oldid=11035534"
Powered by MediaWiki