scientific article; zbMATH DE number 3597592

Cited in

(69)

Algebraic algorithms in GF(q)
Average case optimality
A fast and simple randomized parallel algorithm for maximal matching
Approximation to measurable functions and its relation to probabilistic computation
The algorithm designer versus nature: A game-theoretic approach to information-based complexity
Minimum disclosure proofs of knowledge
The generation of random permutations on the fly
An O(n log n) algorithm for the all-nearest-neighbors problem
Optimal search algorithm for extrema of a discrete periodic bimodal function
Univariate polynomial factorization over finite fields
Fast verification, testing, and generation of large primes
Probabilistic algorithm for testing primality
CPO's of measures for nondeterminism
Evaluation and comparison of two efficient probabilistic primality testing algorithms
Worst case bounds for the Euclidean matching problem
An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
Non deterministic polynomial optimization problems and their approximations
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Semantics of probabilistic programs
Recent developments in primality testing
Some observations on the probabilistic algorithms and NP-hard problems
A time-luck tradeoff in relativized cryptography
An appraisal of computational complexity for operations researchers
An introduction to randomized algorithms
Nested annealing: A provable improvement to simulated annealing
Scheduling with neural networks -- the case of the Hubble Space Telescope
A probabilistic minimum spanning tree algorithm
The complexity of finding fixed-radius near neighbors
A probabilistic remark on algebraic program testing
A note on Rabin's nearest-neighbor algorithm
Universal classes of hash functions
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
Perfect hashing
Verification of the Miller-Rabin probabilistic primality test.
Predicting zero coefficients in formal power series computations.
Estimation of singular values of very large matrices using random sampling
Kinetic \(k\)-semi-Yao graph and its applications
A monad for randomized algorithms
Simulating perfect channels with probabilistic lossy channels
A probabilistic approach to navigation in Hypertext
Randomised algorithms
The time-precision tradeoff problem on on-line probabilistic Turing machines
Algorithmic probabilistic game semantics. Playing games with automata
A new coding-based algorithm for finding closest pair of vectors
Error-bounded probabilistic computations between MA and AM
Hit-and-run algorithms for the identification of nonredundant linear inequalities
On the complexity of closest pair via polar-pair of point-sets
scientific article; zbMATH DE number 3863188 (Why is no real title available?)
Recent developments in information-based complexity
Asymptotically Fast Factorization of Integers
Factorization of the Eighth Fermat Number
A Fast Algorithm for Finding Strong Starters
Algorithmic theory of free solvable groups: randomized computations.
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
On the complexity of closest pair via polar-pair of point-sets
Dominance product and high-dimensional closest pair under \(L_\infty\)
Primality testing
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
Probabilistic verification beyond context-freeness
Finer-grained reductions in fine-grained hardness of approximation
Finer-grained reductions in fine-grained hardness of approximation
Convex language semantics for nondeterministic probabilistic automata
A parallel batch-dynamic data structure for the closest pair problem
Computational geometry with probabilistically noisy primitive operations
Rabin's Closest Pair of Points Algorithm
A probabilistic dynamic logic
Probabilistic Turing machines and recursively enumerable Dedekind cuts
On the complexity of ranking

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4164569)