:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Alpay, Faruk, Sarioglu, Levent
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity 68P05, 68Q25, 03D35 E.1; F.2.2; F.1.1
Online Access:	https://arxiv.org/abs/2603.24597
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

An SoS Entropy Dichotomy via Windowed Hypercontractivity
by: Lela, Marko
Published: (2025)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

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

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

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

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

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

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

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

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

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

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

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

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
by: Grochow, Joshua A., et al.
Published: (2025)

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

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
by: Swenson, Krister M.
Published: (2024)

Dominic Welsh: his work and influence
by: Farr, Graham, et al.
Published: (2024)

Quantum algorithms through graph composition
by: Cornelissen, Arjan
Published: (2025)

Quantum walks through generalized graph composition
by: Cornelissen, Arjan
Published: (2025)

NP-hardness of p-adic linear regression
by: Baker, Gregory D.
Published: (2026)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
by: Collins, Nathaniel A., et al.
Published: (2022)

Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)