Kulikov Alexander Sergeevich

Publications in Math-Net.Ru

1. Complexity of Linear Operators
   
   Leibniz Internat. Proc. in Inform., 149 (2019),  17–12
2. Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
   
   Theory Comput. Syst., 63:5 (2019),  956–986
3. Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
   
   Leibniz Internat. Proc. in Inform., 66:49 (2017),  1–14
4. New upper bounds for the problem of maximal satisfiability
   
   Diskr. Mat., 21:1 (2009),  139–157
5. Automated proofs of upper bounds on the running time of splitting algorithms
   
   Zap. Nauchn. Sem. POMI, 316 (2004),  111–128
6. A $2^{|E|/4}$-time Algorithm for MAX-CUT
   
   Zap. Nauchn. Sem. POMI, 293 (2002),  129–138
7. An upper bound $O(2^{0.16254n})$ for Exact 3-Satisfiability: a simpler proof
   
   Zap. Nauchn. Sem. POMI, 293 (2002),  118–128