PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Gao, Jiawei"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Yulong Gao University of Stuttgart

 

Other publications of authors with the same name

Orthogonal Vectors is hard for first-order properties on sparse graphs., and . Electronic Colloquium on Computational Complexity (ECCC), (2016)Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications., , , and . SODA, page 2162-2181. SIAM, (2017)An Improved Obstacle Avoidance Method for Robot Based on Constraint of Obstacle Boundary Condition., , , , and . CRC, page 28-32. IEEE, (2017)The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games.. CoRR, (2019)On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs.. IPEC, volume 148 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Fine-Grained Complexity of Strengthenings of First-Order Logic., and . Electronic Colloquium on Computational Complexity (ECCC), (2019)Completeness for First-order Properties on Sparse Structures with Algorithmic Applications., , , and . ACM Trans. Algorithms, 15 (2): 23:1-23:35 (2019)On the Fine-grained Complexity of Least Weight Subsequence in Graphs.. Electronic Colloquium on Computational Complexity (ECCC), (2019)Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility., , , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2015)Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs., , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 194-205. Springer, (2013)