Alexander S. Kulikov, Ph.D.

• contact information
  • Laboratory of Mathematical Logic
  • Steklov Institute of Mathematics at St.Petersburg
  • 27 Fontanka, St.Petersburg 191023, Russia
  • email: kulikov()logic.pdmi.ras.ru
• research
  • supervisor: Edward A. Hirsch
  • Ph.D. thesis (2009): "Algorithms for Boolean Logic using Automatization, Combined Complexity Measures, and Clause Learning"
  • interests
    • combinatorics
    • discrete algorithms
    • circuit complexity
  • papers
  • talks
  • projects
  • automated proofs of upper bounds for NP-hard problems
  • first-order theorem prover based on semialgebraic proof systems
  • mixed Boolean-algebraic satisfiability solver
• teaching
• efficient algorithms
• algorithms and data structures
• community service
• Computer Science Club, coordinator
• NoNA Summer School on Complexity Theory 2009, main organizer
• Microsoft Data Structures and Algorithms School 2010, organizer
• misc
  • courses and books on algorithms

Recently added:

• talks: On Convex Complexity Measures
• Microsoft Data Structures and Algorithms School 2010
• papers: P. Hrubes, S. Jukna, A. S. Kulikov, P. Pudlak. On Convex Complexity Measures.