( en | de | ru )

 

Disambiguation of "Kulikov, Alexander S."

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity of Superstring Problems.

, , , , , and . Algorithmica, 79 (3): 798-813 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Kulikov

Roman Kulikov

Vladislav Kulikov

Valentin Kulikov

Viacheslav Kulikov

 

Other publications of authors with the same name

A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function., , and . CiE, volume 7318 of Lecture Notes in Computer Science, page 432-439. Springer, (2012)Solving 3-Superstring in 3 n/3 Time., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 480-491. Springer, (2013)Computing All MOD-Functions Simultaneously., , , and . CSR, volume 7353 of Lecture Notes in Computer Science, page 81-88. Springer, (2012)New Lower Bounds on Circuit Size of Multi-output Functions., , , and . Theory Comput. Syst., 56 (4): 630-642 (2015)Parameterized Complexity of Secluded Connectivity Problems., , , and . Theory Comput. Syst., 61 (3): 795-819 (2017)Families with infants: speeding up algorithms for NP-hard problems using FFT., , and . CoRR, (2014)Families with infants: a general approach to solve hard partition problems., , and . CoRR, (2013)An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers., and . Electron. Colloquium Comput. Complex., (2011)A better-than-3n lower bound for the circuit complexity of an explicit function., , , and . Electron. Colloquium Comput. Complex., (2015)On the Limits of Gate Elimination., , , and . Electron. Colloquium Comput. Complex., (2016)