Image de couverture de livre

Breaking the Temporal Complexity Barrier: Bucket Calculus for Parallel Machine Scheduling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Mohammad, Noor Islam S.
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
par: Guerzhoy, Michael
Publié: (2024)

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
par: Brand, Cornelius, et autres
Publié: (2026)

Complexity of Nonassociative Lambek Calculus with classical logic
par: Płaczek, Paweł
Publié: (2024)

Complexity of Scheduling Charging in the Smart Grid
par: de Weerdt, Mathijs, et autres
Publié: (2017)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
par: Ron, Shiri, et autres
Publié: (2024)

The Complexity of Symmetry Breaking Beyond Lex-Leader
par: Anders, Markus, et autres
Publié: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2026)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
par: Chen, Lijie, et autres
Publié: (2025)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
par: Mouli, Sasank
Publié: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
par: Tyurin, Alexander
Publié: (2024)

The Alignment Trap: Complexity Barriers
par: Yao, Jasper
Publié: (2025)

Recovery Reductions, Conjectures, and Barriers
par: Nareddy, Tejas, et autres
Publié: (2025)

Quantum Complexity vs Classical Complexity: A Survey
par: Vaezi, Arash, et autres
Publié: (2023)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
par: Bodlaender, Hans L., et autres
Publié: (2026)

Temporal Cycle Detection and Acyclic Temporization
par: de Andrade, Davi, et autres
Publié: (2025)

Reasonable Space for the $λ$-Calculus, Logarithmically
par: Accattoli, Beniamino, et autres
Publié: (2022)

Novel Complexity Results for Temporal Separators with Deadlines
par: Dondi, Riccardo, et autres
Publié: (2025)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
par: Balzereit, Kaja, et autres
Publié: (2024)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
par: Goertzel, Ben, et autres
Publié: (2026)

Improved Parallel Repetition for GHZ-Supported Games via Spreadness
par: Liu, Yang P., et autres
Publié: (2026)

An Analytical Approach to Parallel Repetition via CSP Inverse Theorems
par: Bhangale, Amey, et autres
Publié: (2025)

FeatPCA: A feature subspace based principal component analysis technique for enhancing clustering of single-cell RNA-seq data
par: Islam, Md Romizul, et autres
Publié: (2025)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
par: Johnson, Dan, et autres
Publié: (2025)

Structure in Communication Complexity and Constant-Cost Complexity Classes
par: Hatami, Hamed, et autres
Publié: (2024)

$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
par: Majumdar, Angshul
Publié: (2026)

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
par: Cai, Jin-Yi, et autres
Publié: (2026)

From Proof Complexity to Circuit Complexity via Interactive Protocols
par: Arteche, Noel, et autres
Publié: (2024)

Recognizing and Realizing Temporal Reachability Graphs
par: Erlebach, Thomas, et autres
Publié: (2025)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
par: Przybyłek, Michał R., et autres
Publié: (2026)

Parallel Play Saves Quantifiers
par: Carmosino, Marco, et autres
Publié: (2024)

The Complexity of Tensor Rank
par: Schaefer, Marcus, et autres
Publié: (2016)

Pseudodeterministic Communication Complexity
par: Göös, Mika, et autres
Publié: (2025)

Query Complexity with Unknowns
par: Mande, Nikhil S., et autres
Publié: (2024)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
par: Nalli, Sai Soumya, et autres
Publié: (2026)

On the complexity of Multipacking
par: Das, Sandip, et autres
Publié: (2026)

The Complexity of Transitively Orienting Temporal Graphs
par: Mertzios, George B., et autres
Publié: (2021)

Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
par: Mittal, Kunal
Publié: (2025)

The Radical Solution and Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2024)

The Computational Complexity of Factored Graphs
par: Gupta, Shreya, et autres
Publié: (2024)

Separations in Proof Complexity and TFNP
par: Göös, Mika, et autres
Publié: (2022)