Author:
Björklund Andreas,Kaski Petteri,Williams Ryan
Funder
Vetenskapsr?det
H2020 European Research Council
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Bax, E.T., Franklin, J.: A finite-difference sieve to count paths and cycles by length. Inf. Process. Lett. 60(4), 171–176 (1996)
2. Besicovitch, A.S.: On Kakeya’s problem and a similar one. Math. Z. 27(1), 312–320 (1928)
3. Björklund, A.: Below all subsets for some permutational counting problems. In: Proceedings of the 15th SWAT, vol. 17, pp. 1–11 (2016)
4. Björklund, A., Husfeldt, T., Lyckberg, I.: Computing the permanent modulo a prime power. Inf. Process. Lett. 125, 20–25 (2017)
5. Björklund, A., Kaski, P.: How proofs are prepared at Camelot: extended abstract. Proc. PODC 2016, 391–400 (2016)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications;Journal of the ACM;2023-11-30
2. Solving the Hamilton cycle problem fast on average;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Fast Multivariate Multipoint Evaluation Over All Finite Fields;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Fast, algebraic multivariate multipoint evaluation in small characteristic and applications;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. A full complexity dichotomy for immanant families;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15