STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing

Koucky, M. [szerk.]; Bansal, N. [szerk.]

Angol nyelvű Konferenciakötet (Könyv) Tudományos

Megjelent: Association for Computing Machinery (ACM), New York, Amerikai Egyesült Államok, 2385 p. 2025

Konferencia: 57th Annual ACM Symposium on Theory of Computing, STOC 2025 2025-06-23 [Prague, Csehország]

Sorozatok: Proceedings of the Annual ACM Symposium on Theory of Computing 0737-8017

Azonosítók

MTMT: 36244916
ISBN: 9798400715105
Egyéb katalógus: https://opac.k10plus.de/DB=2.299/PPNSET?PPN=1930060483&PRS=HOL&INDEXSET=21
Egyéb URL: https://dl.acm.org/doi/proceedings/10.1145/3717823

Fejezetek

Koh Zhuan Khye et al. Approximating the Held–Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 166-177
Joos F. et al. The Hypergraph Removal Process. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 301-309
Ferber Asaf et al. Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed Graphs. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 336-347
Christandl Matthias et al. Asymptotic Tensor Rank Is Characterized by Polynomials. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 750-755
Eden T. et al. Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 1043-1054
Garg Jugal et al. Constant-Factor EFX Exists for Chores. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 1580-1589
Blanchard Moïse. Agnostic Smoothed Online Learning. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 1997-2006
Bérczi K. et al. Matroid Products via Submodular Coupling. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 2074-2085
Chen Lin et al. Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses. (2025) Megjelent: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing pp. 2086-2097

Hivatkozás stílusok: IEEE ACM APA Chicago Harvard CSLMásolásNyomtatás

STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing

Koucky, M. [szerk.]; Bansal, N. [szerk.]

Lista exportálása irodalomjegyzékként