scientific article; zbMATH DE number 3564899
From MaRDI portal
Publication:4137124
zbMath0363.00013MaRDI QIDQ4137124
No author found.
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Algorithms in computer science (68W99) Conference proceedings and collections of articles (00Bxx)
Related Items
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ An improved exact sampling algorithm for the standard normal distribution ⋮ Dynamic closest pairs — A probabilistic approach ⋮ The Kantorovich metric for probability measures on the circle ⋮ A time-randomness tradeoff for selection in parallel ⋮ An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem ⋮ Learning optimization in simplifying fuzzy rules ⋮ On the measurement of complexity in activity networks ⋮ On some \(\Pi_q\)-identities of Gosper ⋮ Maintenance of configurations in the plane ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Hundreds of impossibility results for distributed computing ⋮ A binary algorithm with low divergence for modular inversion on SIMD architectures ⋮ Parallel tempering for the planted clique problem ⋮ Investigation of finite-sample properties of robust location and scale estimators ⋮ Unnamed Item ⋮ Deniable Functional Encryption ⋮ Exact sublinear binomial sampling ⋮ Quantum and classical tradeoffs ⋮ Molecular dynamics on vector computers
