Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
DOI10.4230/LIPICS.IPEC.2017.6zbMATH Open1443.68043MaRDI QIDQ5111865FDOQ5111865
Authors: Andreas Björklund, Petteri Kaski, Ryan Williams 
Publication date: 27 May 2020
Recommendations
Hamiltonian cyclefinite fieldpermanenthomogeneous polynomialKakeya settabulationfinite vector spaceBesicovitch setpolynomial evaluationfermionant
Symbolic computation and algebraic computation (68W30) Data structures (68P05) Determinants, permanents, traces, other special matrix functions (15A15) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Title not available (Why is that?)
- The complexity of computing the permanent
- Restriction and Kakeya phenomena for finite fields
- Fast polynomial factorization and modular composition
- Title not available (Why is that?)
- Modern computer algebra
- An introduction to geometric complexity theory
- How proofs are prepared at Camelot (extended abstract)
- Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation
- Algebraic methods for interactive proof systems
- Computing the permanent modulo a prime power
- On the size of Kakeya sets in finite vector spaces
- Kakeya-type sets in finite vector spaces
- An improved lower bound on the size of Kakeya sets over finite fields
- Computing and Combinatorics
- Directed Hamiltonicity and out-branchings via generalized Laplacians
- Faster exponential-time algorithms in graphs of bounded average degree
- The complexity of the fermionant and immanants of constant width
- Below all subsets for some permutational counting problems
Cited In (2)
This page was built for publication: Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111865)
