( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for the Graph Homomorphism Problem.

, , , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 481-493. 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.

Sarah Ivanovas

Oxana Ivanova-Chessex

Marian Ivanov

Natalie Ivanits

Svilen Ivanov

 

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

Families with Infants: A General Approach to Solve Hard Partition Problems., , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 551-562. Springer, (2014)Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility., , , , , и . Electron. Colloquium Comput. Complex., (2015)If Edge Coloring is Hard under SETH, then SETH is False., и . SOSA, стр. 115-120. SIAM, (2024)CNF Encodings of Parity., , , и . MFCS, том 241 из LIPIcs, стр. 47:1-47:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Collapsing Superstring Conjecture., , , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 26:1-26:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates., и . CCC, том 234 из LIPIcs, стр. 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tight Lower Bounds on Graph Embedding Problems., , , , , , и . CoRR, (2016)Lower Bounds for the Graph Homomorphism Problem., , , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 481-493. Springer, (2015)Tight Bounds for Graph Homomorphism and Subgraph Isomorphism., , , , , , и . SODA, стр. 1643-1649. SIAM, (2016)Polynomial formulations as a barrier for reduction-based hardness proofs., , , , и . SODA, стр. 3245-3281. SIAM, (2023)