:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autore principale:	Mohammad, Noor Islam S.
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Complexity
Accesso online:	https://arxiv.org/abs/2602.01356
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Complexity of Nonassociative Lambek Calculus with classical logic
di: Płaczek, Paweł
Pubblicazione: (2024)

Complexity of Scheduling Charging in the Smart Grid
di: de Weerdt, Mathijs, et al.
Pubblicazione: (2017)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
di: Ron, Shiri, et al.
Pubblicazione: (2024)

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
di: Brand, Cornelius, et al.
Pubblicazione: (2026)

The Complexity of Symmetry Breaking Beyond Lex-Leader
di: Anders, Markus, et al.
Pubblicazione: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
di: Zheng, Bojin, et al.
Pubblicazione: (2026)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
di: Chen, Lijie, et al.
Pubblicazione: (2025)

The Alignment Trap: Complexity Barriers
di: Yao, Jasper
Pubblicazione: (2025)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
di: Mouli, Sasank
Pubblicazione: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
di: Tyurin, Alexander
Pubblicazione: (2024)

Quantum Complexity vs Classical Complexity: A Survey
di: Vaezi, Arash, et al.
Pubblicazione: (2023)

Reasonable Space for the $λ$-Calculus, Logarithmically
di: Accattoli, Beniamino, et al.
Pubblicazione: (2022)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
di: Bodlaender, Hans L., et al.
Pubblicazione: (2026)

Recovery Reductions, Conjectures, and Barriers
di: Nareddy, Tejas, et al.
Pubblicazione: (2025)

Novel Complexity Results for Temporal Separators with Deadlines
di: Dondi, Riccardo, et al.
Pubblicazione: (2025)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
di: Balzereit, Kaja, et al.
Pubblicazione: (2024)

Temporal Cycle Detection and Acyclic Temporization
di: de Andrade, Davi, et al.
Pubblicazione: (2025)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
di: Goertzel, Ben, et al.
Pubblicazione: (2026)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
di: Johnson, Dan, et al.
Pubblicazione: (2025)

Improved Parallel Repetition for GHZ-Supported Games via Spreadness
di: Liu, Yang P., et al.
Pubblicazione: (2026)

An Analytical Approach to Parallel Repetition via CSP Inverse Theorems
di: Bhangale, Amey, et al.
Pubblicazione: (2025)

FeatPCA: A feature subspace based principal component analysis technique for enhancing clustering of single-cell RNA-seq data
di: Islam, Md Romizul, et al.
Pubblicazione: (2025)

The Complexity of Transitively Orienting Temporal Graphs
di: Mertzios, George B., et al.
Pubblicazione: (2021)

Parallel Play Saves Quantifiers
di: Carmosino, Marco, et al.
Pubblicazione: (2024)

Structure in Communication Complexity and Constant-Cost Complexity Classes
di: Hatami, Hamed, et al.
Pubblicazione: (2024)

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

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
di: Cai, Jin-Yi, et al.
Pubblicazione: (2026)

On the complexity of Multipacking
di: Das, Sandip, et al.
Pubblicazione: (2026)

From Proof Complexity to Circuit Complexity via Interactive Protocols
di: Arteche, Noel, et al.
Pubblicazione: (2024)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
di: Chauhan, Archit, et al.
Pubblicazione: (2025)

Recognizing and Realizing Temporal Reachability Graphs
di: Erlebach, Thomas, et al.
Pubblicazione: (2025)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
di: Przybyłek, Michał R., et al.
Pubblicazione: (2026)

Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
di: Mittal, Kunal
Pubblicazione: (2025)

A Calculus for Finite Parts and Residues of some Divergent Complex Geometric Integrals
di: Svensson, Ludvig
Pubblicazione: (2025)

The Complexity of Tensor Rank
di: Schaefer, Marcus, et al.
Pubblicazione: (2016)

Pseudodeterministic Communication Complexity
di: Göös, Mika, et al.
Pubblicazione: (2025)

Query Complexity with Unknowns
di: Mande, Nikhil S., et al.
Pubblicazione: (2024)

Scheduling Problems with Constrained Rejections
di: Davies, Sami, et al.
Pubblicazione: (2025)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
di: Nalli, Sai Soumya, et al.
Pubblicazione: (2026)