computational-complexity

Documents about computational-complexity

• Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity#658884arXiv (All)
• Fair Vertex Problems Parameterized by Cluster Vertex Deletion#173251arXiv (OAI)
• Set Theory in the Foundation of Math; Internal Classes and External Sets#920155arXiv (OAI Expanded)
• Set Theory in the Foundation of Math; Internal Classes and External Sets#924386arXiv (All)
• Fine-Grained $\mathrm{AC}^0$ Lower Bounds for $k$-$\mathrm{OV}$, $k$-$\mathrm{XOR}$, and $k$-$\mathrm{SUM}$ via Colored Subgraph Isomorphism#927418arXiv (All)
• Structural Parameterizations for Eternal Vertex Cover#1011606arXiv (All)
• Improved Bounds for Coin Flipping, Leader Election, and Random Selection#179140arXiv (OAI)
• THE VERTEX COVER GAME#684896HAL (France)
• Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width#985164arXiv (All)
• Mitigating client heterogeneity in federated learning: a reinforcement learning approach for efficient client selection#1055327Springer Nature OA
• The Doublyte Language Paradigm: Deterministic Multi-Dimensional Topology Fabric Core Substrate Layer#996432Figshare
• SAR-ERL: an evolutionary reinforcement learning optimization method based on state–action co-representation embedding#145128Springer Nature OA
• On the Exponential Circuit Imbalance of the Ben-Tal Nemirovski Approximation#792805arXiv (All)
• Channel-Adaptive Edge AI: Maximizing Inference Throughput by Adapting Computational Complexity to Channel States#820377arXiv (All)
• Filosofia computației: Realitate și calcul. Suport de curs, Universitatea din București, 2026#337305Figshare
• Edge-coloring problems with forbidden patterns and planted colors#177099arXiv (OAI)
• Algorithms for Finite Group Epimorphism Testing#984353arXiv (All)
• Tight Time-Space Lower Bounds for Collision Finding and Element Distinctness under Label Symmetry#997793arXiv (All)
• Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825arXiv (All)
• Unraveling the Complexity of Host-Microbe Interactions Through Integrative Omics and Systems Biology Approaches#169167DigitalCommons@USU
• Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings#996848arXiv (All)
• Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism#1034478arXiv (All)
• AutoSec-Agent: a fully autonomous and ethical multi-agent framework for scalable penetration testing using large language models#416644Springer Nature OA
• Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters#974738arXiv (All)
• Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State Distance#1037352arXiv (All)
• A Structural Proof of the Lower Bound 21 for $3\times3$ Matrix Multiplication over $\mathbb F_2$#1012889arXiv (All)
• The use of entanglement in non-cooperative games, and the computational power of indefinite causal order#178036HAL (France)
• Characterisation of the Set of Ground States of Uniformly Chaotic Finite-Range Lattice Models#996850arXiv (All)
• Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses#983587eScholarship
• FOUNDATIONAL MISALIGNMENT: A Clinical Diagnosis of Contemporary Mathematics with P vs NP as Paradigmatic Case#264346Zenodo (CERN)
• Charting the landscape of diameter computation on geometric intersection graphs in the plane#433564ISTA Publications
• Constructive solvability and the P versus NP problem#617261arXiv (OAI Expanded)
• Constructive solvability and the P versus NP problem#617761arXiv (All)
• A Lightweight CNN Integrated Compact Convolutional Transformer for Multi-Scale Feature Learning and reducing computational complexity for breast cancer mammography image detection and classification#1012413arXiv (All)
• Evaluator Transport and Finite-State Descendant Reconstruction for Self-Modifying Agents#482308Figshare