1 – 5 of 5
- show: 100
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2022
-
Mark
The shortest even cycle problem is tractable
2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-25(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
The Traveling Salesman Problem in Bounded Degree Graphs
(
- Contribution to journal › Article