Pages that link to "Item:Q1253894"
From MaRDI portal
The following pages link to A probabilistic remark on algebraic program testing (Q1253894):
Displaying 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Zero testing of algebraic functions (Q286968) (← 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)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem (Q384796) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← 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)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Sparse interpolation of multivariate rational functions (Q633622) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- The inverse moment problem for convex polytopes (Q714983) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Additive preconditioning for matrix computations (Q846341) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Two notions of correctness and their relation to testing (Q1161275) (← links)
- Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Joint equidistribution of CM points (Q1711493) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- An efficient solution for Cauchy-like systems of linear equations (Q1767958) (← links)
- A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
- Weighted Reed-Muller codes revisited (Q1934223) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
