1 – 2 of 2
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
(
- Contribution to journal › Article