Saved in:
| Main Authors: | Zheng, Bojin, Wang, Weiwu |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.15790 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
by: Zheng, Bojin, et al.
Published: (2026)
by: Zheng, Bojin, et al.
Published: (2026)
Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
by: Zheng, Jingwen, et al.
Published: (2026)
by: Zheng, Jingwen, et al.
Published: (2026)
The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)
by: Fearnley, John, et al.
Published: (2023)
The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)
by: Gupta, Shreya, et al.
Published: (2024)
Random Permutations in Computational Complexity
by: Hitchcock, John M., et al.
Published: (2025)
by: Hitchcock, John M., et al.
Published: (2025)
An Overview of the Theory of Instances Computational Complexity
by: Jorge A. Ruiz-Vanoye
Published: (2011)
by: Jorge A. Ruiz-Vanoye
Published: (2011)
Computational Complexity of Game Boy Games
by: Tirmazi, Hayder, et al.
Published: (2024)
by: Tirmazi, Hayder, et al.
Published: (2024)
Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
by: Przybyłek, Michał R., et al.
Published: (2026)
by: Przybyłek, Michał R., et al.
Published: (2026)
On the Computational Complexity of Schrödinger Operators
by: Zheng, Yufan, et al.
Published: (2024)
by: Zheng, Yufan, et al.
Published: (2024)
Assembly Theory and its Relationship with Computational Complexity
by: Kempes, Christopher P., et al.
Published: (2024)
by: Kempes, Christopher P., et al.
Published: (2024)
The Parameterized Complexity of Computing the Linear Vertex Arboricity
by: Erhardt, Alexander, et al.
Published: (2025)
by: Erhardt, Alexander, et al.
Published: (2025)
Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
by: Takahata, Takuma, et al.
Published: (2025)
by: Takahata, Takuma, et al.
Published: (2025)
Scheme-Theoretic Approach to Computational Complexity. III. SETH
by: Çivril, Ali
Published: (2023)
by: Çivril, Ali
Published: (2023)
Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
by: Daghbouche, Karim
Published: (2025)
by: Daghbouche, Karim
Published: (2025)
Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)
by: Chabaud, Ulysse, et al.
Published: (2024)
A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
by: Okada, Naoaki, et al.
Published: (2024)
by: Okada, Naoaki, et al.
Published: (2024)
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
by: Jackiewicz, Marcel, et al.
Published: (2024)
by: Jackiewicz, Marcel, et al.
Published: (2024)
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
by: Çivril, Ali
Published: (2021)
by: Çivril, Ali
Published: (2021)
The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)
by: Lock, Edwin, et al.
Published: (2024)
Kernelization Complexity of Solution Discovery Problems
by: Grobler, Mario, et al.
Published: (2024)
by: Grobler, Mario, et al.
Published: (2024)
Computational Complexities of Folding
by: Eppstein, David
Published: (2024)
by: Eppstein, David
Published: (2024)
Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation
by: Çivril, Ali
Published: (2023)
by: Çivril, Ali
Published: (2023)
Computational Complexity in Property Testing
by: Pinto Jr., Renato Ferreira, et al.
Published: (2025)
by: Pinto Jr., Renato Ferreira, et al.
Published: (2025)
Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)
by: Oliveira, Igor C.
Published: (2025)
Computational Complexity of Swish
by: Horiyama, Takashi, et al.
Published: (2026)
by: Horiyama, Takashi, et al.
Published: (2026)
Why Philosophers Should Care About Computational Complexity
by: Aaronson, Scott
Published: (2011)
by: Aaronson, Scott
Published: (2011)
Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)
by: Barch, Brian, et al.
Published: (2025)
Additive Models Explained: A Computational Complexity Approach
by: Bassan, Shahaf, et al.
Published: (2025)
by: Bassan, Shahaf, et al.
Published: (2025)
Arithmetic Complexity of Solutions of the Dirichlet Problem
by: Boche, Holger, et al.
Published: (2026)
by: Boche, Holger, et al.
Published: (2026)
Identity Testing for Radical Expressions
by: Balaji, Nikhil, et al.
Published: (2022)
by: Balaji, Nikhil, et al.
Published: (2022)
Expected Complexity of Persistence Barcode Computation via Matrix Reduction
by: Giunti, Barbara, et al.
Published: (2021)
by: Giunti, Barbara, et al.
Published: (2021)
Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
by: Çivril, Ali
Published: (2021)
by: Çivril, Ali
Published: (2021)
Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
by: Tyurin, Alexander
Published: (2024)
by: Tyurin, Alexander
Published: (2024)
On Computability of Computable Problems
by: Khaliq, Asad
Published: (2023)
by: Khaliq, Asad
Published: (2023)
Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)
by: Hatami, Hamed, et al.
Published: (2024)
The Complexity of Blocking All Solutions
by: Grüne, Christoph, et al.
Published: (2025)
by: Grüne, Christoph, et al.
Published: (2025)
From Proof Complexity to Circuit Complexity via Interactive Protocols
by: Arteche, Noel, et al.
Published: (2024)
by: Arteche, Noel, et al.
Published: (2024)
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
by: Bok, Jan, et al.
Published: (2021)
by: Bok, Jan, et al.
Published: (2021)
The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)
by: Kontogiannis, Andreas, et al.
Published: (2026)
The Computational Complexity of Circuit Discovery for Inner Interpretability
by: Adolfi, Federico, et al.
Published: (2024)
by: Adolfi, Federico, et al.
Published: (2024)
Similar Items
-
Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
by: Zheng, Bojin, et al.
Published: (2026) -
Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
by: Zheng, Jingwen, et al.
Published: (2026) -
The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023) -
The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024) -
Random Permutations in Computational Complexity
by: Hitchcock, John M., et al.
Published: (2025)