Saved in:
| Main Author: | Khaliq, Asad |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.09410 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
Computational relative entropy
by: Meyer, Johannes Jakob, et al.
Published: (2025)
by: Meyer, Johannes Jakob, et al.
Published: (2025)
On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)
by: Čertík, Michal, et al.
Published: (2025)
Equivalence of Countable and Computable
by: Zhang, Hantao
Published: (2024)
by: Zhang, Hantao
Published: (2024)
Almost-catalytic Computation
by: Bisoyi, Sagar, et al.
Published: (2024)
by: Bisoyi, Sagar, et al.
Published: (2024)
Lossy Catalytic Computation
by: Gupta, Chetan, et al.
Published: (2024)
by: Gupta, Chetan, et al.
Published: (2024)
The Radical Solution and Computational Complexity
by: Zheng, Bojin, et al.
Published: (2024)
by: Zheng, Bojin, et al.
Published: (2024)
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)
There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
by: Kayibi, Koko-Kalambay Kalafan
Published: (2018)
by: Kayibi, Koko-Kalambay Kalafan
Published: (2018)
Computational Complexity of Game Boy Games
by: Tirmazi, Hayder, et al.
Published: (2024)
by: Tirmazi, Hayder, et al.
Published: (2024)
Topics in Theoretical Computer Science
by: Rode, Alexander Forrest
Published: (2025)
by: Rode, Alexander Forrest
Published: (2025)
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
by: Li, Zhengyu, et al.
Published: (2023)
by: Li, Zhengyu, et al.
Published: (2023)
Inference Scaling vs Reasoning: An Empirical Analysis of Compute-Optimal LLM Problem-Solving
by: AbdElhameed, Marwan, et al.
Published: (2024)
by: AbdElhameed, Marwan, 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)
Computing the Elementary Symmetric Polynomials in Positive Characteristics
by: Orzel, Ian
Published: (2025)
by: Orzel, Ian
Published: (2025)
Reverse-Robust Computation with Chemical Reaction Networks
by: Kini, Ravi, et al.
Published: (2026)
by: Kini, Ravi, et al.
Published: (2026)
Computing eulerian magnitude homology
by: Menara, Giuliamaria, et al.
Published: (2024)
by: Menara, Giuliamaria, et al.
Published: (2024)
Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
by: Schleich, Philipp, et al.
Published: (2024)
by: Schleich, Philipp, et al.
Published: (2024)
Scheme-Theoretic Approach to Computational Complexity. III. SETH
by: Çivril, Ali
Published: (2023)
by: Çivril, Ali
Published: (2023)
Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
by: Takahata, Takuma, et al.
Published: (2025)
by: Takahata, Takuma, et al.
Published: (2025)
On the Computational Hardness of Transformers
by: Saha, Barna, et al.
Published: (2026)
by: Saha, Barna, et al.
Published: (2026)
Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs
by: Ruszil, Jakub, et al.
Published: (2026)
by: Ruszil, Jakub, et al.
Published: (2026)
The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
On the Holographic Geometry of Deterministic Computation
by: Nye, Logan
Published: (2025)
by: Nye, Logan
Published: (2025)
Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)
by: Chabaud, Ulysse, et al.
Published: (2024)
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)
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)
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
by: Çivril, Ali
Published: (2021)
by: Çivril, Ali
Published: (2021)
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)
Specification and Automatic Verification of Computational Reductions
by: Grange, Julien, et al.
Published: (2024)
by: Grange, Julien, et al.
Published: (2024)
Logic and Computation through the Lens of Semirings
by: Barlag, Timon, et al.
Published: (2025)
by: Barlag, Timon, et al.
Published: (2025)
Computational complexity of the Weisfeiler-Leman dimension
by: Lichter, Moritz, et al.
Published: (2024)
by: Lichter, Moritz, et al.
Published: (2024)
The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)
by: Lock, Edwin, et al.
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 Complexities of Folding
by: Eppstein, David
Published: (2024)
by: Eppstein, David
Published: (2024)
The Computational Advantage of MIP* Vanishes in the Presence of Noise
by: Dong, Yangjing, et al.
Published: (2023)
by: Dong, Yangjing, et al.
Published: (2023)
The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)
by: Fearnley, John, et al.
Published: (2023)
Similar Items
-
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
by: Jackiewicz, Marcel, et al.
Published: (2024) -
Computational relative entropy
by: Meyer, Johannes Jakob, et al.
Published: (2025) -
On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025) -
Equivalence of Countable and Computable
by: Zhang, Hantao
Published: (2024) -
Almost-catalytic Computation
by: Bisoyi, Sagar, et al.
Published: (2024)