The following pages link to (Q4164569):
Displayed 50 items.
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- On the complexity of ranking (Q920620) (← links)
- Algebraic algorithms in GF(q) (Q1066670) (← links)
- Average case optimality (Q1071513) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity (Q1100895) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- The generation of random permutations on the fly (Q1111400) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- Optimal search algorithm for extrema of a discrete periodic bimodal function (Q1121183) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Fast verification, testing, and generation of large primes (Q1132906) (← links)
- Probabilistic algorithm for testing primality (Q1135871) (← links)
- CPO's of measures for nondeterminism (Q1139367) (← links)
- Evaluation and comparison of two efficient probabilistic primality testing algorithms (Q1144064) (← links)
- Worst case bounds for the Euclidean matching problem (Q1149255) (← links)
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p) (Q1151027) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← 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)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- An introduction to randomized algorithms (Q1182319) (← 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 probabilistic minimum spanning tree algorithm (Q1241278) (← links)
- The complexity of finding fixed-radius near neighbors (Q1244819) (← links)
- A probabilistic remark on algebraic program testing (Q1253894) (← links)
- A note on Rabin's nearest-neighbor algorithm (Q1257342) (← links)
- Universal classes of hash functions (Q1259907) (← links)
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
- Perfect hashing (Q1391123) (← links)
- Verification of the Miller-Rabin probabilistic primality test. (Q1400288) (← links)
- Predicting zero coefficients in formal power series computations. (Q1599549) (← links)
- Estimation of singular values of very large matrices using random sampling (Q1612504) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- A monad for randomized algorithms (Q1744376) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- A probabilistic approach to navigation in Hypertext (Q1818980) (← links)
- Randomised algorithms (Q1836980) (← links)
- The time-precision tradeoff problem on on-line probabilistic Turing machines (Q1838301) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)