Imagen de Portada

Symport/Antiport P Systems with Membrane Separation Characterize P^(#P)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ducros, Vivien, Zandron, Claudio
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Closure Properties and Characterizations of TotP
por: Ivanashev, Yaroslav
Publicado: (2025)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
por: Çivril, Ali
Publicado: (2021)

Some conditions implying if P=NP then P=PSPACE
por: Rodriguez, Ismael
Publicado: (2026)

P=NP
por: Deng, Zikang
Publicado: (2024)

P vs. NP
por: Uribe, Daniel
Publicado: (2016)

On P Versus NP
por: Gordeev, Lev
Publicado: (2020)

Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology
por: Alasli, M.
Publicado: (2026)

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
por: Çivril, Ali
Publicado: (2021)

A Critique of Deng's "P=NP"
por: Humphreys, Isabel, et al.
Publicado: (2025)

An approximation notion between P and FPTAS
por: Bismuth, Samuel, et al.
Publicado: (2026)

Colouring $(P_r+P_s)$-Free Graphs
por: Klimošová, Tereza, et al.
Publicado: (2018)

P-time Algorithms for Typical #EO Problems
por: Meng, Boning, et al.
Publicado: (2024)

The Complexity of (P3, H)-Arrowing and Beyond
por: Hassan, Zohair Raza
Publicado: (2024)

Search versus Decision for $\mathsf{S}_2^\mathsf{P}$
por: Fortnow, Lance
Publicado: (2025)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
por: Meng, Boning, et al.
Publicado: (2025)

Total Variation Distance for Product Distributions is $\#\mathsf{P}$-Complete
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
por: Borzechowski, Michaela, et al.
Publicado: (2023)

Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete problems and ${\mathord{\#}\mathrm P}$-hardness of circuit extraction in phase-free ZH
por: Mitosek, Piotr
Publicado: (2024)

A proof of P!=NP
por: McCallum, Rupert
Publicado: (2020)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
por: Alasli, M.
Publicado: (2025)

#P-hardness proofs of matrix immanants evaluated on restricted matrices
por: Miklos, Istvan, et al.
Publicado: (2021)

Extensively Not P-Bi-Immune promiseBQP-Complete Languages
por: Jackson, Andrew
Publicado: (2024)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
por: Kayibi, Koko-Kalambay Kalafan
Publicado: (2018)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

Bipartite Exact Matching in P
por: Du, Yuefeng
Publicado: (2026)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
por: Borzechowski, Michaela, et al.
Publicado: (2024)

Multiplicative weights, equalizers, and P=PPAD
por: Avramopoulos, Ioannis
Publicado: (2016)

Perfect Zero-Knowledge PCPs for #P
por: Gur, Tom, et al.
Publicado: (2024)

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
por: Wei, Jing-Yuan
Publicado: (2026)

Constructive Separations and Their Consequences
por: Chen, Lijie, et al.
Publicado: (2022)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Separations in Proof Complexity and TFNP
por: Göös, Mika, et al.
Publicado: (2022)

Constructive Separations from Gate Elimination
por: Carmosino, Marco, et al.
Publicado: (2026)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
por: Ming, Gao
Publicado: (2022)

A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
por: Goertzel, Ben
Publicado: (2025)

Separations between Combinatorial Measures for Transitive Functions
por: Chakraborty, Sourav, et al.
Publicado: (2021)

Complexity of Unambiguous Problems in $Σ^P_2$
por: Gilboa, Matan, et al.
Publicado: (2025)

A Hierarchy of Tinhofer Graphs: Separations and Membership Testing
por: Bhattacharjee, Sutanay, et al.
Publicado: (2026)

An Exponential Separation between Deterministic CDCL and DPLL Solvers
por: Samar, Sahil, et al.
Publicado: (2026)