Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.20262 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Low Sets and Closure Properties of Counting Function Classes
by: Ivanashev, Yaroslav
Published: (2025)
by: Ivanashev, Yaroslav
Published: (2025)
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
by: Armand, Jules, et al.
Published: (2025)
by: Armand, Jules, et al.
Published: (2025)
Symport/Antiport P Systems with Membrane Separation Characterize P^(#P)
by: Ducros, Vivien, et al.
Published: (2025)
by: Ducros, Vivien, et al.
Published: (2025)
Closure under factorization from a result of Furstenberg
by: Bhattacharjee, Somnath, et al.
Published: (2025)
by: Bhattacharjee, Somnath, et al.
Published: (2025)
Debordering Closure Results in Determinantal and Pfaffian Ideals
by: Dey, Anakin, et al.
Published: (2025)
by: Dey, Anakin, et al.
Published: (2025)
Determination Problems for Orbit Closures and Matrix Groups
by: Manssour, Rida Ait El, et al.
Published: (2024)
by: Manssour, Rida Ait El, et al.
Published: (2024)
Sampling Permutations with Cell Probes is Hard
by: Alekseev, Yaroslav, et al.
Published: (2025)
by: Alekseev, Yaroslav, et al.
Published: (2025)
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
by: Nosan, Klara, et al.
Published: (2021)
by: Nosan, Klara, et al.
Published: (2021)
Linear Matroid Intersection is in Catalytic Logspace
by: Agarwala, Aryan, et al.
Published: (2025)
by: Agarwala, Aryan, et al.
Published: (2025)
Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026)
by: Rodriguez, Ismael
Published: (2026)
P=NP
by: Deng, Zikang
Published: (2024)
by: Deng, Zikang
Published: (2024)
Characterizing Direct Product Testing via Coboundary Expansion
by: Bafna, Mitali, et al.
Published: (2023)
by: Bafna, Mitali, et al.
Published: (2023)
Properties of calculus in r-Complexity 2025
by: Folea, Rares, et al.
Published: (2026)
by: Folea, Rares, et al.
Published: (2026)
P vs. NP
by: Uribe, Daniel
Published: (2016)
by: Uribe, Daniel
Published: (2016)
On P Versus NP
by: Gordeev, Lev
Published: (2020)
by: Gordeev, Lev
Published: (2020)
Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology
by: Alasli, M.
Published: (2026)
by: Alasli, M.
Published: (2026)
On Extremal Properties of k-CNF: Capturing Threshold Functions
by: Gurumukhani, Mohit, et al.
Published: (2024)
by: Gurumukhani, Mohit, et al.
Published: (2024)
A Critique of Deng's "P=NP"
by: Humphreys, Isabel, et al.
Published: (2025)
by: Humphreys, Isabel, et al.
Published: (2025)
An approximation notion between P and FPTAS
by: Bismuth, Samuel, et al.
Published: (2026)
by: Bismuth, Samuel, et al.
Published: (2026)
P-time Algorithms for Typical #EO Problems
by: Meng, Boning, et al.
Published: (2024)
by: Meng, Boning, et al.
Published: (2024)
The Complexity of (P3, H)-Arrowing and Beyond
by: Hassan, Zohair Raza
Published: (2024)
by: Hassan, Zohair Raza
Published: (2024)
Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
A Proposed Characterization of p-Simulation Between Theories
by: Monroe, Hunter
Published: (2025)
by: Monroe, Hunter
Published: (2025)
Toward a Characterization of Simulation Between Arithmetic Theories
by: Monroe, Hunter
Published: (2026)
by: Monroe, Hunter
Published: (2026)
Search versus Decision for $\mathsf{S}_2^\mathsf{P}$
by: Fortnow, Lance
Published: (2025)
by: Fortnow, Lance
Published: (2025)
The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
by: Meng, Boning, et al.
Published: (2025)
by: Meng, Boning, et al.
Published: (2025)
Total Variation Distance for Product Distributions is $\#\mathsf{P}$-Complete
by: Bhattacharyya, Arnab, et al.
Published: (2024)
by: Bhattacharyya, Arnab, et al.
Published: (2024)
Catalytic Computing and Register Programs Beyond Log-Depth
by: Alekseev, Yaroslav, et al.
Published: (2025)
by: Alekseev, Yaroslav, et al.
Published: (2025)
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
by: Çivril, Ali
Published: (2021)
by: Çivril, Ali
Published: (2021)
Characterizing the Distinguishability of Product Distributions through Multicalibration
by: Marcussen, Cassandra, et al.
Published: (2024)
by: Marcussen, Cassandra, et al.
Published: (2024)
Property Testing in Bounded Degree Hypergraphs
by: Aaronson, Hugo, et al.
Published: (2025)
by: Aaronson, Hugo, et al.
Published: (2025)
Enumeration With Nice Roman Domination Properties
by: Mann, Kevin
Published: (2025)
by: Mann, Kevin
Published: (2025)
An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
by: Alasli, M.
Published: (2025)
by: Alasli, M.
Published: (2025)
On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
by: Borzechowski, Michaela, et al.
Published: (2023)
by: Borzechowski, Michaela, et al.
Published: (2023)
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)
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)
Fully Characterizing Lossy Catalytic Computation
by: Folkertsma, Marten, et al.
Published: (2024)
by: Folkertsma, Marten, et al.
Published: (2024)
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)
by: Baillot, Patrick, et al.
Published: (2024)
Structure-Aware Encodings of Argumentation Properties for Clique-width
by: Mahmood, Yasir, et al.
Published: (2025)
by: Mahmood, Yasir, et al.
Published: (2025)
Lower Bounds for Unitary Property Testing with Proofs and Advice
by: Weggemans, Jordi
Published: (2024)
by: Weggemans, Jordi
Published: (2024)