scientific article
From MaRDI portal
Publication:4040055
zbMath0643.68003MaRDI QIDQ4040055
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycryptographyprobabilistic algorithmsNP-completenessdata structureshistorical notesefficiency of algorithms
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Software, source code, etc. for problems pertaining to number theory (11-04) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms, On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms, Path-based depth-first search for strong and biconnected components, Fast rectangular matrix multiplication and QR decomposition, A MapReduce-based distributed SVM ensemble for scalable image classification and annotation, New approaches for understanding the asymptotic complexity of \(A^*\) tree searching., The mathematical modeling of heuristics., On the distribution for the duration of a randomized leader election algorithm, Computing the reciprocal of units in Galois rings, The determinant of a tree's neighborhood matrix, Minimum disclosure proofs of knowledge, The generation of random numbers that are probably prime, The exact fitting problem in higher dimensions, Job distribution algorithms, Lower bounds for the matrix chain ordering problem, Perfect hashing, On \(k\)-ary \(n\)-cubes: Theory and applications., Analysis of quickselect : an algorithm for order statistics, Exchanging disks in the tower of hanoi, On aggregation of normed structures, On quasi-metric aggregation functions and fixed point theorems, New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces, On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms, Solving the satisfiability problem by using randomized approach, An almost-constant round interactive zero-knowledge proof, Fixed point theorems in generalized metric spaces with applications to computer science, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science, Convergence rates for steady-state derivative estimators, Characterization and processing of simple prefixed-chain recursion, New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs, Searching for important factors in simulation models with many factors: Sequential bifurcation, Table design in dynamic programming, Accelerating machines: a review, How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems, The minimum labeling spanning trees, On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
