mtmt
Magyar Tudományos Művek Tára
XML
JSON
Átlépés a keresőbe
In English
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Angol nyelvű
Megjelent:
2022
Konferencia:
54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 2022-01-06 [Rome, Olaszország]
Azonosítók
MTMT: 32872335
ISBN:
9781450392648
Fejezetek
Gharibian S. et al. Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 19-32
Gharibian S. et al. Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 19-32
Cornelissen A. et al. Near-optimal Quantum algorithms for multivariate mean estimation. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 33-43
Bansal Nikhil et al. The Power of Two Choices in Graphical Allocation. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 52-63
Giakkoupis George. Expanders via local edge flips in quasilinear time. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 64-76
Cen Ruoxu et al. Edge Connectivity Augmentation in Near-Linear Time. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 137-150
Pettie Seth et al. Optimal Vertex Connectivity Oracles. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 151-161
Assadi Sepehr et al. Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 234-247
Assadi Sepehr et al. Deterministic Graph Coloring in the Streaming Model*. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 261-274
Bansal N. et al. Flow time scheduling and prefix Beck-Fiala. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 331-342
Cohen-Addad Vincent. Bypassing the Surface Embedding: Approximation Schemes for Network Design in Minor-Free Graphs. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 343-356
Dinur Irit et al. Locally Testable Codes with Constant Rate, Distance, and Locality. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 357-374
Halldorsson Magnus M. et al. Near-Optimal Distributed Degree+1 Coloring. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 450-463
Balliu Alkida et al. Distributed Delta-Coloring Plays Hide-and-Seek*. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 464-477
Allamigeon Xavier et al. No Self-Concordant Barrier Interior Point Method Is Strongly Polynomial. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 515-528
Jambulapati Arun et al. Improved Iteration Complexities for Overconstrained p-Norm Regression. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 529-542
Efremenko Klim et al. Circuits Resilient to Short-Circuit Errors. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 582-594
Cherapanamjeri Yeshwanth et al. Uniform Approximations for Randomized Hadamard Transforms with Applications. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 659-671
Liu Siqi et al. Testing Thresholds for High-Dimensional Sparse Random Geometric Graphs. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 672-677
Anagnostides Ioannis et al. Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-player General-Sum Games. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 736-749
Hastings Matthew B. et al. Optimizing Strongly Interacting Fermionic Hamiltonians. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 776-789
Chen Sitan et al. Kalman Filtering with Adversarial Corruptions*. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 832-845
Jansen Bart M. et al. Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 900-913
Lokshtanov Daniel et al. Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 914-923
Bonnet É. et al. Twin-width IV: ordered graphs and matrices. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 924-937
Kim Eun Jung et al. Directed Flow-Augmentation. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 938-947
Bhangale Amey et al. On Approximability of Satisfiable k-CSPs: I. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 976-988
Girish Uma et al. Parallel Repetition for All 3-Player Games over Binary Alphabet. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 998-1009
Cohen-Addad Vincent et al. Towards Optimal Lower Bounds for k-Median and k-Means Coresets. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1038-1051
Filtser Arnold et al. Locality-Sensitive Orderings and Applications to Reliable Spanners. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1066-1079
Sherstov Alexander A.. The Approximate Degree of DNF and CNF Formulas. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1194-1207
Harms Nathaniel et al. Randomized Communication and Implicit Graph Representations. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1220-1233
Amir Daniel et al. Optimal Oblivious Reconfigurable Networks. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1339-1352
Carlson C. et al. Computational thresholds for the fixed-magnetization Ising model. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1459-1472
Chan Timothy M. et al. Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1501-1514
Focke Jacob et al. Counting Small Induced Subgraphs with Hereditary Properties. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1543-1551
Grandoni Fabrizio et al. Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1598-1611
Karlin Anna R. et al. An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-subgraph Problem. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1612-1620
Cohen-Addad Vincent et al. Improved Approximations for Euclidean k-Means and k-Median, via Nested Quasi-Independent Sets. (2022) Megjelent: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing pp. 1621-1628
Hivatkozás stílusok:
IEEE
ACM
APA
Chicago
Harvard
CSL
Másolás
Nyomtatás
2024-12-03 15:13
×
Lista exportálása irodalomjegyzékként
Hivatkozás stílusok:
IEEE
ACM
APA
Chicago
Harvard
Nyomtatás
Másolás
