Imagen de Portada

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jia, He, Laddha, Aditi, Lee, Yin Tat, Vempala, Santosh S.
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Computational Complexity Functional Analysis
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster logconcave sampling from a cold start in high dimension
por: Kook, Yunbum, et al.
Publicado: (2025)

The Localization Method for High-Dimensional Inequalities
por: Kook, Yunbum, et al.
Publicado: (2025)

Zeroth-order Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2025)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
por: Khanna, Sanjeev, et al.
Publicado: (2026)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
por: Esmer, Barış Can, et al.
Publicado: (2022)

Frontier Space-Time Algorithms Using Only Full Memory
por: Chmel, Petr, et al.
Publicado: (2026)

Rounding Large Independent Sets on Expanders
por: Bafna, Mitali, et al.
Publicado: (2024)

The Query Complexity of Local Search and Brouwer in Rounds
por: Brânzei, Simina, et al.
Publicado: (2020)

The Query Complexity of Local Search in Rounds on General Graphs
por: Brânzei, Simina, et al.
Publicado: (2026)

Faster Convolutions: Yates and Strassen Revisited
por: Brand, Cornelius, et al.
Publicado: (2025)

Learning low-degree quantum objects
por: Arunachalam, Srinivasan, et al.
Publicado: (2024)

More Asymmetry Yields Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2024)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
por: Gribanov, Dmitry, et al.
Publicado: (2022)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
por: Banik, Aritra, et al.
Publicado: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
por: Kumar, Mrinal, et al.
Publicado: (2024)

A Refined Laser Method and Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2020)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
por: Doney, Kyle, et al.
Publicado: (2025)

Improved Algorithm for Permutation Testing
por: Zhang, Xiaojin
Publicado: (2020)

Efficient Catalytic Graph Algorithms
por: Cook, James, et al.
Publicado: (2025)

Algorithms and Hardness for Estimating Statistical Similarity
por: Bhattacharyya, Arnab, et al.
Publicado: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
por: Agarwala, Aryan, et al.
Publicado: (2025)

Sensitivity Lower Bounds for Approximaiton Algorithms
por: Fleming, Noah, et al.
Publicado: (2024)

Semi-Streaming Algorithms for Graph Property Certification
por: Das, Avinandan, et al.
Publicado: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
por: Gaikwad, Ajinkya, et al.
Publicado: (2024)

Hardness and Algorithmic Results for Roman \{3\}-Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
por: Capelli, Florent, et al.
Publicado: (2021)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
por: Austrin, Per, et al.
Publicado: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
por: Buhrman, Harry, et al.
Publicado: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
por: Tate, Elise, et al.
Publicado: (2025)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time
por: Stoian, Mihail
Publicado: (2024)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
por: Mao, Songtao
Publicado: (2026)

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
por: Zhang, Bingwei, et al.
Publicado: (2026)

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
por: Amini, Amin
Publicado: (2024)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
por: Jiang, Cheng, et al.
Publicado: (2026)