Pages that link to "Item:Q3899517"
From MaRDI portal
The following pages link to Fast Probabilistic Algorithms for Verification of Polynomial Identities (Q3899517):
Displaying 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Zero testing of algebraic functions (Q286968) (← links)
- Black-box polynomial resultants (Q286994) (← links)
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach (Q314201) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
- The generalized Erdős-Falconer distance problems in vector spaces over finite fields (Q452378) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- Common composites of triangular polynomial systems and hash functions (Q492031) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- On the Alon-Füredi bound (Q510534) (← links)
- Categories generated by a trivalent vertex (Q522650) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Sparse interpolation of multivariate rational functions (Q633622) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
- Counting curves and their projections (Q677992) (← links)
- Sparse interpolation of symmetric polynomials (Q678607) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- On the decidability of sparse univariate polynomial interpolation (Q685722) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Interrogating witnesses for geometric constraint solving (Q714618) (← links)
- The inverse moment problem for convex polytopes (Q714983) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Probabilistic checking of associativity in algebras (Q752151) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- The key-dependent message security of key-alternating Feistel ciphers (Q826271) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Additive preconditioning for matrix computations (Q846341) (← links)
