- New Upper Bounds on the Boolean Circuit Complexity of Symmetric Functions
- First Report on the Semialgebraic Prover 1 PDMI PREPRINT | 09/2004
- New Bounds for MAX-SAT by Clause Learning Alexander S. Kulikov1
- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms ?
- Finding Efficient Circuits Using SAT-solvers Arist Kojevnikov1
- PDMI PREPRINT ---21/2006 AUTOMATED PROOFS OF UPPER BOUNDS FOR NPHARD
- Circuit Complexity and Multiplicative Complexity of Boolean Functions
- On Convex Complexity Measures P. Hrubesa,1, S. Juknab,c,2, A. Kulikovd,3, P. Pudlak,e,4
- New Bounds for MAX-SAT by Clause Learning Alexander S. Kulikov
- , c < 2 , N , MAX-SAT ;
- On covering graphs by complete bipartite subgraphs and A. S. Kulikov 2,
- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
- A New Approach to Proving Upper Bounds for MAX-2-SAT Arist Kojevnikov
- PDMI PREPRINT --21/2006 AUTOMATED PROOFS OF UPPER BOUNDS FOR NP-HARD
- An Elementary Proof of a 3n -o(n) Lower Bound on the Circuit Complexity of Affine
