Travelled to:1 × Denmark
1 × Japan
1 × USA
2 × United Kingdom
Collaborated with:A.Kojevnikov A.Golovnev I.Mihajlin ∅ G.Yaroslavtsev F.V.Fomin
Talks about:problem (2) sat (2) semialgebra (1) homomorph (1) restrict (1) approach (1) simplif (1) generat (1) general (1) falsiti (1)
Person: Alexander S. Kulikov
DBLP: Kulikov:Alexander_S=
Contributed to:
20152014
200920062005Wrote 5 papers:
- ICALP-v1-2015-FominGKM #bound #graph #morphism #problem
- Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
- ICALP-v1-2014-GolovnevKM #approach #problem #product line
- Families with Infants: A General Approach to Solve Hard Partition Problems (AG, ASK, IM), pp. 551–562.
- SAT-2009-KojevnikovKY #performance #using
- Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.
- SAT-2006-KojevnikovK #algebra #complexity #proving #strict
- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.
- SAT-2005-Kulikov #automation #generative #satisfiability
- Automated Generation of Simplification Rules for SAT and MAXSAT (ASK), pp. 430–436.