scientific article; zbMATH DE number 7205190
From MaRDI portal
Publication:5111865
DOI10.4230/LIPIcs.IPEC.2017.6zbMath1443.68043MaRDI QIDQ5111865
Petteri Kaski, Andreas Björklund, R. Ryan Williams
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite fieldHamiltonian cyclepermanenthomogeneous polynomialpolynomial evaluationBesicovitch setKakeya settabulationfinite vector spacefermionant
Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the size of Kakeya sets in finite vector spaces
- The complexity of computing the permanent
- Kakeya-type sets in finite vector spaces
- An introduction to geometric complexity theory
- An improved lower bound on the size of Kakeya sets over finite fields
- Restriction and Kakeya phenomena for finite fields
- Computing the permanent modulo a prime power
- Modern Computer Algebra
- The complexity of the fermionant, and immanants of constant width
- Fast Polynomial Factorization and Modular Composition
- Algebraic methods for interactive proof systems
- Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
- Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree
- How Proofs are Prepared at Camelot
- Computing and Combinatorics
This page was built for publication:
