Univariate ideal membership parameterized by rank, degree, and number of generators
From MaRDI portal
Publication:2075388
DOI10.1007/s00224-021-10053-wOpenAlexW2963364856MaRDI QIDQ2075388
Rajit Datta, Partha Mukhopadhyay, V. Arvind, Abhranil Chatterjee
Publication date: 14 February 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10787
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- Constrained multilinear detection for faster functional motif discovery
- The ideal membership problem and polynomial identity testing
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- A probabilistic remark on algebraic program testing
- A note on graph colorings and graph polynomials
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Polynomial identity testing for depth 3 circuits
- An inequality for the discriminant of a polynomial
- Diagonal Circuit Identity Testing and Lower Bounds
- Faster Algebraic Algorithms for Path and Packing Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Combinatorial Nullstellensatz
- Rank and chromatic number of a graph
- Color-coding
- Two Algorithmic Results for the Traveling Salesman Problem
- The rank and size of graphs
- LIMITS and Applications of Group Algebras for Parameterized Problems
- Extensor-coding
- From sylvester-gallai configurations to rank bounds
- The complexity of satisfiability problems
- Parameterized Algorithms
This page was built for publication: Univariate ideal membership parameterized by rank, degree, and number of generators
