Imagen de Portada

Improved Algorithm for Permutation Testing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zhang, Xiaojin
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sampling Permutations with Cell Probes is Hard
por: Alekseev, Yaroslav, et al.
Publicado: (2025)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
por: Kuschner, Jordan, et al.
Publicado: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
por: Bai, Tian, et al.
Publicado: (2026)

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

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

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
por: Scheder, Dominik, et al.
Publicado: (2025)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
por: Baril, Ambroise, et al.
Publicado: (2025)

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

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

On Optimal Testing of Linearity
por: Arora, Vipul, et al.
Publicado: (2024)

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

The Trichotomy of Regular Property Testing
por: Bathie, Gabriel, et al.
Publicado: (2025)

Testing Properties of Edge Distributions
por: Fei, Yumou
Publicado: (2026)

Lower Bounds for Convexity Testing
por: Chen, Xi, et al.
Publicado: (2024)

Computational Complexity in Property Testing
por: Pinto Jr., Renato Ferreira, 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)

Testing noisy low-degree polynomials for sparsity
por: Bao, Yiqiao, et al.
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)

Improved Hardness-of-Approximation for Token Swapping
por: Hiken, Sam, et al.
Publicado: (2024)

Improved Space Bounds for Subset Sum
por: Belova, Tatiana, et al.
Publicado: (2024)

Multi-Pass Streaming Lower Bounds for Uniformity Testing
por: Li, Qian, et al.
Publicado: (2025)

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

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

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
por: Kumar, Mrinal, 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)

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

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

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

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

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
por: Arvind, V., et al.
Publicado: (2023)

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