Imagen de Portada

Sorting by pile shuffles on queue-like and stack-like piles can be hard

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Treleaven, Kyle B.
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sorting permutations with pile shuffle on queue-like and stack-like piles
por: Treleaven, Kyle B.
Publicado: (2025)

Collision-resistant hash-shuffles on the reals
por: Barmpalias, George, et al.
Publicado: (2025)

The PCP-like Theorem for Sub-linear Time Inapproximability
por: Ma, Hengzhao, et al.
Publicado: (2021)

The Probability Spaces of QuickSort
por: Nadareishvili, George, et al.
Publicado: (2025)

Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
por: Goubault-Larrecq, Aliénor, et al.
Publicado: (2025)

Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space
por: Gryaznov, Svyatoslav, et al.
Publicado: (2024)

Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases
por: Aly, Anas Gamal, et al.
Publicado: (2025)

Communication Complexity is NP-hard
por: Hirahara, Shuichi, et al.
Publicado: (2025)

Injective hardness condition for PCSPs
por: Banakh, Demian, et al.
Publicado: (2024)

If VNP is hard, then so are equations for it
por: Kumar, Mrinal, et al.
Publicado: (2020)

Coordinating "7 Billion Humans" is hard
por: Panconesi, Alessandro, et al.
Publicado: (2024)

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

On the hardness of finding normal surfaces
por: Burton, Benjamin A., et al.
Publicado: (2019)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
por: Romão, Leonardo Gasparini, et al.
Publicado: (2025)

An even simpler hard variant of Not-All-Equal 3-SAT
por: Darmann, Andreas, et al.
Publicado: (2024)

Partial Minimum Branching Program Size Problem is ETH-hard
por: Glinskih, Ludmila, et al.
Publicado: (2024)

Man, these New York Times games are hard! A computational perspective
por: Alberti, Alessandro Giovanni, et al.
Publicado: (2025)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
por: Baraskar, Omkar, et al.
Publicado: (2024)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
por: Sato, Atsuki, et al.
Publicado: (2024)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
por: Krokhin, Andrei, et al.
Publicado: (2025)

Direct Product Primality Testing of Graphs is GI-hard
por: Calderoni, Luca, et al.
Publicado: (2020)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

Rice-like complexity lower bounds for Boolean and uniform automata networks
por: Goubault-Larrecq, Aliénor, et al.
Publicado: (2024)

Two NP-hard Extensions of the Spearman Footrule even for a Small Constant Number of Voters
por: Durand, Martin
Publicado: (2026)

Complexity and hardness of random peaked circuits
por: Zhang, Yuxuan
Publicado: (2025)

On the hardness of cloning and connections to representation theory
por: Havlíček, Vojtěch, et al.
Publicado: (2024)

Optimising quantum circuits is generally hard
por: van de Wetering, John, et al.
Publicado: (2023)

Geometric and computational hardness of bilevel programming
por: Bolte, Jérôme, et al.
Publicado: (2024)

On hardness of computing analytic Brouwer degree
por: Chakraborty, Somnath
Publicado: (2023)

NP-hardness of SVP in Euclidean Space
por: Wan, Daqing
Publicado: (2026)

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition
por: Meir, Or
Publicado: (2023)

Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
por: Silva, Lucas de Oliveira, et al.
Publicado: (2025)

Between proper and square coloring of planar graphs, hardness and extremal graphs
por: Delépine, Thomas
Publicado: (2026)

Quantum Max-Cut is NP hard to approximate
por: Piddock, Stephen
Publicado: (2025)

How hard is it to verify a classical shadow?
por: Karaiskos, Georgios, et al.
Publicado: (2025)

DQC1-hardness of estimating correlation functions
por: Moulik, Subhayan Roy, et al.
Publicado: (2024)

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
por: Ron-Zewi, Noga, et al.
Publicado: (2024)

Prove Symbolic Regression is NP-hard by Symbol Graph
por: Song, Jinglu, et al.
Publicado: (2024)

Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes
por: Kergaßner, Matthias, et al.
Publicado: (2024)