Pages that link to "Item:Q4113883"

The following pages link to A Fast Monte-Carlo Test for Primality (Q4113883):

Displayed 50 items.

• Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) ‎ (← links)
• Algorithmic theory of free solvable groups: randomized computations. (Q402669) ‎ (← links)
• On a problem posed by Steve Smale (Q661924) ‎ (← links)
• Complexity classes of equivalence problems revisited (Q716333) ‎ (← links)
• A probabilistic lower bound for checking disjointness of sets (Q794167) ‎ (← links)
• Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) ‎ (← links)
• Efficient, perfect polynomial random number generators (Q809536) ‎ (← links)
• Irreducibility of multivariate polynomials (Q1083191) ‎ (← links)
• Generating quasi-random sequences from semi-random sources (Q1088641) ‎ (← links)
• Approximation to measurable functions and its relation to probabilistic computation (Q1088659) ‎ (← links)
• On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) ‎ (← links)
• A nonlinear public key cryptosystem (Q1102923) ‎ (← links)
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) ‎ (← links)
• Minimum disclosure proofs of knowledge (Q1110348) ‎ (← links)
• The generation of random permutations on the fly (Q1111400) ‎ (← links)
• Probabilistic quantifiers and games (Q1112019) ‎ (← links)
• The generation of random numbers that are probably prime (Q1118632) ‎ (← links)
• Fast verification, testing, and generation of large primes (Q1132906) ‎ (← links)
• Probabilistic algorithm for testing primality (Q1135871) ‎ (← links)
• Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153) ‎ (← links)
• Evaluation and comparison of two efficient probabilistic primality testing algorithms (Q1144064) ‎ (← links)
• Non deterministic polynomial optimization problems and their approximations (Q1152215) ‎ (← links)
• Discrete extremal problems (Q1152306) ‎ (← links)
• Semantics of probabilistic programs (Q1159979) ‎ (← links)
• Recent developments in primality testing (Q1160213) ‎ (← links)
• Some observations on the probabilistic algorithms and NP-hard problems (Q1163371) ‎ (← links)
• An introduction to randomized algorithms (Q1182319) ‎ (← links)
• A heuristic irreducibility test for univariate polynomials (Q1186702) ‎ (← links)
• Nested annealing: A provable improvement to simulated annealing (Q1193895) ‎ (← links)
• Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) ‎ (← links)
• A note on Rabin's nearest-neighbor algorithm (Q1257342) ‎ (← links)
• Universal classes of hash functions (Q1259907) ‎ (← links)
• Primality testing with fewer random bits (Q1321031) ‎ (← links)
• Verification of the Miller-Rabin probabilistic primality test. (Q1400288) ‎ (← links)
• On testing for zero polynomials by a set of points with bounded precision. (Q1401255) ‎ (← links)
• Dynamical analysis of a class of Euclidean algorithms. (Q1401315) ‎ (← links)
• A probabilistic algorithm for updating files over a communication link (Q1575956) ‎ (← links)
• Generalized strong pseudoprime tests and applications (Q1582299) ‎ (← links)
• Predicting zero coefficients in formal power series computations. (Q1599549) ‎ (← links)
• Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) ‎ (← links)
• Estimation of singular values of very large matrices using random sampling (Q1612504) ‎ (← links)
• A monad for randomized algorithms (Q1744376) ‎ (← links)
• Randomised algorithms (Q1836980) ‎ (← links)
• The time-precision tradeoff problem on on-line probabilistic Turing machines (Q1838301) ‎ (← links)
• One complexity theorist's view of quantum computing (Q1870556) ‎ (← links)
• From Monte Carlo to quantum computation (Q1873014) ‎ (← links)
• Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) ‎ (← links)
• A connection between random variables and latin \(k\)-cubes (Q1903745) ‎ (← links)
• The error probability of the Miller-Rabin primality test (Q1992114) ‎ (← links)
• A new probabilistic primality test (Q2202823) ‎ (← links)