Author of the publication

Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility.

, , , , , and . ITCS, page 261-270. ACM, (2016)

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.

 

Other publications of authors with the same name

Families with Infants: A General Approach to Solve Hard Partition Problems., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 551-562. Springer, (2014)Collapsing Superstring Conjecture., , , and . CoRR, (2018)Tight Bounds for Graph Homomorphism and Subgraph Isomorphism., , , , , , and . SODA, page 1643-1649. SIAM, (2016)Tight Lower Bounds on Graph Embedding Problems., , , , , , and . CoRR, (2016)Lower Bounds for the Graph Homomorphism Problem., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 481-493. Springer, (2015)Collapsing Superstring Conjecture., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 26:1-26:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility., , , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2015)Tight Bounds for Subgraph Isomorphism and Graph Homomorphism., , , and . CoRR, (2015)Tight Lower Bounds on Graph Embedding Problems., , , , , , and . J. ACM, 64 (3): 18:1-18:22 (2017)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)