On enumerating monomials and other combinatorial structures by polynomial interpolation
From MaRDI portal
(Redirected from Publication:385504)
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
- Enumeration of the monomials of a polynomial and related complexity classes
- Interpolation polynomials. Application in findingsome combinatorial formulas
- scientific article; zbMATH DE number 6603592
- On monomial complete permutation polynomials
- Combinatorics of F-Polynomials
- Combinatorics of polynomials iterations
- scientific article; zbMATH DE number 123387
- Combinatorial algorithms for the interpolation of polynomials in dimension \(\geq 2\)
- Recurrence relations and enumerative interpretations of some combinatorial numbers and polynomials
- On enumeration of polynomial equivalence classes
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1104328 (Why is no real title available?)
- scientific article; zbMATH DE number 1786671 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- A Course in Enumeration
- A probabilistic remark on algebraic program testing
- An almost optimal rank bound for depth-3 identities
- Black-box identity testing of depth-4 multilinear circuits
- Characterizing Valiant's algebraic complexity classes
- Completeness and reduction in algebraic complexity theory
- Computational Complexity
- Deterministic identity testing of depth-\(4\) multilinear circuits with bounded top fan-in
- Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
- Enumeration complexity of logical query problems with second-order variables
- Enumeration of the monomials of a polynomial and related complexity classes
- Expressing a fraction of two determinants as a determinant
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Feasible arithmetic computations: Valiant's hypothesis
- First-order queries on structures of bounded degree are computable with constant delay
- Generating Linear Extensions Fast
- Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs
- Interpolating polynomials from their values
- Interpolation of polynomials given by straight-line programs
- Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits
- Limits and Applications of Group Algebras for Parameterized Problems
- Linear delay enumeration and monadic second-order logic
- Listing graphs that satisfy first-order sentences
- Matching is as easy as matrix inversion
- Matrix multiplication via arithmetic progressions
- Matroid matching and some applications
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Multiplying matrices faster than coppersmith-winograd
- On generating all maximal independent sets
- PRIMES is in P
- Parametrized complexity theory.
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
- Randomness efficient identity testing of multivariate polynomials
- The Complexity of Acyclic Subhypergraph Problems
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- The complexity of computing the permanent
Cited in
(11)- Enumerating models of DNF faster: breaking the dependency on the formula size
- Incremental delay enumeration: space and time
- The Hermit-type reproducing kernel particle method for elasticity problems
- Combinatorial algorithms for the interpolation of polynomials in dimension \(\geq 2\)
- Enumeration of the monomials of a polynomial and related complexity classes
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Derandomizing isolation in space-bounded settings
- Radial basis reproducing kernel particle method for piezoelectric materials
- The numerical analysis of piezoelectric ceramics based on the Hermite-type RPIM
- Monomials, multilinearity and identity testing in simple read-restricted circuits
- Weight enumerators, intersection enumerators, and Jacobi polynomials
This page was built for publication: On enumerating monomials and other combinatorial structures by polynomial interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385504)
