Copertina

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Alpay, Faruk, Sarioglu, Levent
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Complexity 68P05, 68Q25, 03D35 E.1; F.2.2; F.1.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
di: Lela, Marko
Pubblicazione: (2025)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
di: Ye, Lixi
Pubblicazione: (2026)

Attention Meets Reachability: Structural Equivalence and Efficiency in Grammar-Constrained LLM Decoding
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
di: Hakoniemi, Tuomas, et al.
Pubblicazione: (2024)

NP-hard problems are not in BQP
di: Czerwinski, Reiner
Pubblicazione: (2023)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Explicit separations between randomized and deterministic Number-on-Forehead communication
di: Kelley, Zander, et al.
Pubblicazione: (2023)

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
di: von Liechtenstein, Maximilian R. P.
Pubblicazione: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
di: Edwards, Darren J.
Pubblicazione: (2025)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
di: Böhnlein, Toni, et al.
Pubblicazione: (2024)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
di: Lela, Marko
Pubblicazione: (2025)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
di: Dorochko, Leonid, et al.
Pubblicazione: (2026)

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

Quantum Advantage in Computational Chemistry?
di: Gundlach, Hans, et al.
Pubblicazione: (2025)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
di: Bodirsky, Manuel, et al.
Pubblicazione: (2023)

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization
di: Alpay, Faruk
Pubblicazione: (2025)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
di: Saffidine, Abdallah, et al.
Pubblicazione: (2025)

Evolomino is NP-complete
di: Nikolaev, Andrei V.
Pubblicazione: (2025)

Extended Nullstellensatz proof systems
di: Krajicek, Jan
Pubblicazione: (2023)

The Impact of Partial Computations on the Red-Blue Pebble Game
di: Papp, Pál András, et al.
Pubblicazione: (2025)

Adversarial Barrier in Uniform Class Separation
di: Rosko, Milan
Pubblicazione: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
di: Bodirsky, Manuel, et al.
Pubblicazione: (2024)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
di: Bannach, Max, et al.
Pubblicazione: (2025)

The Word Problem for Products of Symmetric Groups
di: Simon, Hans U.
Pubblicazione: (2025)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
di: Xia, Mingji
Pubblicazione: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
di: Galatos, Nikolaos, et al.
Pubblicazione: (2025)

A Logspace Constructive Proof of L=SL
di: Buss, Sam, et al.
Pubblicazione: (2025)

Quantum Search without Global Diffusion
di: Burke, John, et al.
Pubblicazione: (2026)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
di: Schewe, Klaus-Dieter
Pubblicazione: (2020)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
di: Al-atar, Munqath, et al.
Pubblicazione: (2024)

The Serial Scaling Hypothesis
di: Liu, Yuxi, et al.
Pubblicazione: (2025)

On the existence of strong proof complexity generators
di: Krajicek, Jan
Pubblicazione: (2022)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Information-Theoretic Constraints on Variational Quantum Optimization: Efficiency Transitions and the Dynamical Lie Algebra
di: Tan, Jun Liang
Pubblicazione: (2025)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
di: Huseynzade, Rafig
Pubblicazione: (2025)

Transordinal Fixed-Point Operators and Self-Referential Games: A Categorical Framework for Reflective Semantic Convergence
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

A correspondence between the time and space complexity
di: Latkin, Ivan V.
Pubblicazione: (2023)