scientific article; zbMATH DE number 3597592
From MaRDI portal
zbMath0384.60001MaRDI QIDQ4164569
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Estimation of singular values of very large matrices using random sampling, A Fast Algorithm for Finding Strong Starters, Kinetic \(k\)-semi-Yao graph and its applications, Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms, Approximation to measurable functions and its relation to probabilistic computation, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, 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, Unnamed Item, Asymptotically Fast Factorization of Integers, 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, Perfect hashing, Probabilistic algorithm for testing primality, Algorithmic theory of free solvable groups: randomized computations., CPO's of measures for nondeterminism, Efficient randomized incremental algorithm for the closest pair problem using Leafary trees, A new coding-based algorithm for finding closest pair of vectors, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Verification of the Miller-Rabin probabilistic primality test., Worst case bounds for the Euclidean matching problem, Factorization of the Eighth Fermat Number, An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p), Non deterministic polynomial optimization problems and their approximations, Recent developments in information-based complexity, 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, On the complexity of ranking, A time-luck tradeoff in relativized cryptography, An appraisal of computational complexity for operations researchers, An introduction to randomized algorithms, A monad for randomized algorithms, Nested annealing: A provable improvement to simulated annealing, Algorithmic probabilistic game semantics. Playing games with automata, Scheduling with neural networks -- the case of the Hubble Space Telescope, Hit-and-run algorithms for the identification of nonredundant linear inequalities, Primality testing, Simulating perfect channels with probabilistic lossy channels, A probabilistic minimum spanning tree algorithm, Error-bounded probabilistic computations between MA and AM, 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, On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic, Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle, A probabilistic approach to navigation in Hypertext, Randomised algorithms, The time-precision tradeoff problem on on-line probabilistic Turing machines, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, A probabilistic dynamic logic, Probabilistic Turing machines and recursively enumerable Dedekind cuts, Predicting zero coefficients in formal power series computations., Dominance Product and High-Dimensional Closest Pair under L_infty, Algebraic algorithms in GF(q), Average case optimality, A fast and simple randomized parallel algorithm for maximal matching
