Výsledky vyhledávání - "((\"computing algorithms and informal\") OR (\"computing algorithms and informatik\"))~"

IMPROVED CLASSICAL AND QUANTUM ALGORITHMS FOR THE SHORTEST VECTOR PROBLEM VIA BOUNDED DISTANCE DECODING.

Autoři: AGGARWAL, DIVESH YANLIN CHEN KUMARS, RAJENDRA a další

Zdroj: SIAM Journal on Computing; 2025, Vol. 54 Issue 2, p233-278, 46p

Témata: TIME complexity, RANDOM access memory, QUANTUM computing, ISOMORPHISM (Mathematics), ALGORITHMS

The Computational Advantage of MIP* Vanishes in the Presence of Noise.

Autoři: Dong, Yangjing Fu, Honghao Natarajan, Anand a další

Zdroj: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-78, 78p

Témata: NOISE, COMPUTATIONAL complexity, QUANTUM entanglement, QUANTUM computing, MATRIX functions

The Kikuchi Hierarchy and Tensor PCA.

Autoři: Wein, Alexander El Alaoui, Ahmed Moore, Cristopher

Zdroj: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-40, 40p

Témata: STATISTICAL physics, SUM of squares, ALGORITHMS, BAYESIAN analysis, MESSAGE passing (Computer science), PRINCIPAL components analysis

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Autoři: Chen, Li Kyng, Rasmus Liu, Yang a další

Zdroj: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-103, 103p

Témata: DIRECTED acyclic graphs, DATA structures, INTERIOR-point methods, ISOTONIC regression, FLOWGRAPHS

Early adapting to trends: self-stabilizing information spread using passive communication.

Autoři: Korman, Amos Vacus, Robin

Zdroj: Distributed Computing; Dec2024, Vol. 37 Issue 4, p335-362, 28p

Témata: DISTRIBUTED computing, COMMUNICATION models, INFORMATION storage & retrieval systems, PROBLEM solving, ALGORITHMS

Fast Algorithms for ℓp-Regression.

Autoři: Adil, Deeksha Kyng, Rasmus Peng, Richard a další

Zdroj: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-45, 45p

Témata: COMPUTER science, LINEAR systems, MACHINE learning, LEAST squares, ALGORITHMS

Fast Quantum Subroutines for the Simplex Method.

Autoři: Nannicini, Giacomo

Zdroj: Operations Research; Mar/Apr2024, Vol. 72 Issue 2, p763-780, 18p

Témata: SIMPLEX algorithm, QUANTUM computing, MATRIX multiplications, QUANTUM computers, SPARSE matrices

Korporace: AIR Force Research Laboratory (Edwards Air Force Base, Calif.)

Relative Error StreamingQuantiles.

Autoři: CORMODE, GRAHAM KARNIN, ZOHAR LIBERTY, EDO a další

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-48, 48p

Témata: APPROXIMATION algorithms, DATA structures, EXTREME value theory, LINEAR orderings, APPROXIMATION error, TASK analysis

On the Need for Large Quantum Depth.

Autoři: NAI-HUI CHIA KAI-MIN CHUNG CHING-YI LAI

Zdroj: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-38, 38p

Témata: QUANTUM computing, QUANTUM computers, CIRCUIT complexity, FOURIER transforms, LOGICAL prediction, HYBRID computers (Computer architecture)

Flow-augmentation I: Directed graphs.

Autoři: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin a další

Zdroj: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Memory Checking Requires Logarithmic Overhead.

Autoři: Boyle, Elette Komargodski, Ilan Vafa, Neekon

Zdroj: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-43, 43p

Témata: CLIENT/SERVER computing, TRUST, CHECKERS, CHECKS, MEMORY

Locally checkable problems in rooted trees.

Autoři: Balliu, Alkida Brandt, Sebastian Chang, Yi-Jun a další

Zdroj: Distributed Computing; Sep2023, Vol. 36 Issue 3, p277-311, 35p

Témata: DETERMINISTIC algorithms, GRAPH algorithms, DISTRIBUTED algorithms, DISTRIBUTED computing, INDEPENDENT sets, COMPUTATIONAL complexity

Rounds vs. Communication Tradeoffs for Maximal Independent Sets.

Autoři: Assadi, Sepehr Kol, Gillat Zhang, Zhijun

Zdroj: SIAM Journal on Computing; 2025, Vol. 54 Issue 5, p22-20-22-20, 1p

Témata: INDEPENDENT sets, COMMUNICATION models, DISTRIBUTED computing, DISTRIBUTED algorithms, BIPARTITE graphs, MATHEMATICAL bounds, COMMUNICATION complexity (Information theory)

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity.

Autoři: Akmal, Shyan Jin, Ce

Zdroj: Algorithmica; May2024, Vol. 86 Issue 5, p1623-1656, 34p

Témata: DIRECTED graphs, DIRECTED acyclic graphs, FLOWGRAPHS, UNDIRECTED graphs, TIME complexity, RANDOM matrices

A (Slightly) Improved Approximation Algorithm for Metric TSP.

Autoři: Karlin, Anna R. Klein, Nathan Oveis Gharan, Shayan

Zdroj: Operations Research; Nov/Dec2024, Vol. 72 Issue 6, p2543-2594, 52p

Témata: APPROXIMATION algorithms, RAYLEIGH model, SPANNING trees, AIR forces, ENTROPY

Real-time computing and robust memory with deterministic chemical reaction networks.

Autoři: Fletcher, Willem Klinge, Titus H. Lathrop, James I. a další

Zdroj: Natural Computing; Sep2025, Vol. 24 Issue 3, p383-397, 15p

Témata: REAL-time computing, CHEMICAL systems, TURING machines, PERTURBATION theory, ALGEBRAIC numbers, LYAPUNOV stability, ANALOG computers

Improving Quantum Computation by Optimized Qubit Routing.

Autoři: Wagner, Friedrich Bärmann, Andreas Liers, Frauke a další

Zdroj: Journal of Optimization Theory & Applications; Jun2023, Vol. 197 Issue 3, p1161-1194, 34p

Témata: OPTIMIZATION algorithms, QUANTUM computing, COST functions, APPROXIMATION algorithms, INTEGER programming, CIRCUIT complexity, ROUTING algorithms

Sublinear-time distributed algorithms for detecting small cliques and even cycles.

Autoři: Eden, Talya Fiat, Nimrod Fischer, Orr a další

Zdroj: Distributed Computing; Jun2022, Vol. 35 Issue 3, p207-234, 28p

Témata: CIRCUIT complexity, LIBRARY catalogs, COMBINATORICS, CHARTS, diagrams, etc., SUBGRAPHS, INTERSECTION graph theory, DISTRIBUTED computing, DISTRIBUTED algorithms

Query Lower Bounds for Log-concave Sampling.

Autoři: Chewi, Sinho de Dios Pont, Jaume Li, Jerry a další

Zdroj: Journal of the ACM; Aug2024, Vol. 71 Issue 4, p1-42, 42p

Témata: GEOMETRIC measure theory, WISHART matrices, LOGICAL prediction, ALGORITHMS, KRYLOV subspace

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP.

Autoři: C.S., Karthik Lee, Euiwoong Manurangsi, Pasin

Zdroj: Algorithmica; Dec2025, Vol. 87 Issue 12, p1711-1731, 21p

Témata: COMPUTATIONAL complexity, COMBINATORIAL optimization, MATHEMATICAL optimization, APPROXIMATION algorithms, CONSTRAINT satisfaction