The following pages link to PRIMES is in P (Q1772458):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- On the distribution of Atkin and Elkies primes (Q404278) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
- Limit cycle bifurcations from a non-degenerate center (Q426465) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Elements of high order in finite fields of the form (Q439074) (← links)
- Primality test for numbers of the form \(A p^n + w_n\) (Q491620) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\) (Q530392) (← links)
- On some subgroups of the multiplicative group of finite rings (Q558195) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Codes correcting restricted errors (Q670208) (← links)
- The complexity of explicit constructions (Q693069) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- Integer factoring and modular square roots (Q896029) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- On the effectiveness of a generalization of Miller's primality theorem (Q964923) (← links)
- There are infinitely many Perrin pseudoprimes (Q971844) (← links)
- Galaxy cutsets in graphs (Q975761) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Elliptic Gauss sums and applications to point counting (Q979143) (← links)
- Satisfiability of algebraic circuits over sets of natural numbers (Q987688) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- On the complexity of constructing Golomb rulers (Q1028469) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank (Q1650656) (← links)
- Pattern matching with wildcards using words of shorter length (Q1675874) (← links)
- Super-Golden-Gates for \(PU(2)\) (Q1701020) (← links)
- Erratum: ``PRIMES is in P'' (Q1711495) (← links)
- Proof pearl: Bounding least common multiples with triangles (Q1722641) (← links)
- Primality testing with Gaussian periods (Q1737980) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- A monad for randomized algorithms (Q1744376) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)