( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of Superstring Problems.

, , , , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 89-99. Springer, (2015)

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.

Alexander Kulikov

Roman Kulikov

Vladislav Kulikov

Valentin Kulikov

Viacheslav Kulikov

 

Другие публикации лиц с тем же именем

Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates., и . Electron. Colloquium Comput. Complex., (2016)Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds., , , , , и . SODA, стр. 1834-1853. SIAM, (2024)Lower Bounds for Unrestricted Boolean Circuits: Open Problems.. CSR, том 10846 из Lecture Notes in Computer Science, стр. 15-22. Springer, (2018)An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers., и . MFCS, том 6907 из Lecture Notes in Computer Science, стр. 256-265. Springer, (2011)Parameterized Complexity of Superstring Problems., , , , , и . Algorithmica, 79 (3): 798-813 (2017)Solving SCS for bounded length strings in fewer than 2n steps., , и . Inf. Process. Lett., 114 (8): 421-425 (2014)Approximating Shortest Superstring Problem Using de Bruijn Graphs., , и . CPM, том 7922 из Lecture Notes in Computer Science, стр. 120-129. Springer, (2013)Greedy Conjecture for Strings of Length 4., , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 307-315. Springer, (2015)Complexity of Semialgebraic Proofs with Restricted Degree of Falsity., и . SAT, том 4121 из Lecture Notes in Computer Science, стр. 11-21. Springer, (2006)A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function., , , и . FOCS, стр. 89-98. IEEE Computer Society, (2016)