Image de couverture de livre

The PPP-completeness of the Ward-Szabo theorem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ishizuka, Takashi
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Atropos-k is PSPACE-complete
par: Yang, Chao, et autres
Publié: (2024)

Maker-Maker games of rank 4 are PSPACE-complete
par: Galliot, Florian, et autres
Publié: (2025)

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

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
par: Galliot, Florian
Publié: (2025)

Factorization norms and an inverse theorem for MaxCut
par: Balla, Igor, et autres
Publié: (2025)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
par: Armand, Jules, et autres
Publié: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

Is Graph Local Complementation Inherently Sequential?
par: Concha-Vega, Pablo
Publié: (2025)

How to Reconfigure Your Alliances
par: Fernau, Henning, et autres
Publié: (2025)

List Decoding Quotient Reed-Muller Codes
par: Gotlib, Omri, et autres
Publié: (2025)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
par: Concha-Vega, Pablo, et autres
Publié: (2025)

On the Incompressibility of Truth With Application to Circuit Complexity
par: Tonon, Luke
Publié: (2025)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
par: Harary, Marc
Publié: (2025)

On the complexity of freezing automata networks of bounded pathwidth
par: Goles, Eric, et autres
Publié: (2025)

Enumeration With Nice Roman Domination Properties
par: Mann, Kevin
Publié: (2025)

A Distance Amplification Lemma for Monotonicity
par: Minzer, Dor
Publié: (2025)

Maximum Reachability Orientation of Mixed Graphs
par: Hörsch, Florian
Publié: (2025)

Parameterized Complexity of Segment Routing
par: Bazgan, Cristina, et autres
Publié: (2025)

On the enumeration of Tarski fixed points
par: Müller, Julian
Publié: (2023)

Edge-Disjoint Paths in Eulerian Digraphs
par: Cavallaro, Dario, et autres
Publié: (2024)

Relations between monotone complexity measures based on decision tree complexity
par: Byramji, Farzan, et autres
Publié: (2024)

Gap Preserving Reductions Between Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2022)

Computational complexity of the Weisfeiler-Leman dimension
par: Lichter, Moritz, et autres
Publié: (2024)

Gap Amplification for Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2023)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
par: Marcille, Clara, et autres
Publié: (2026)

Enumerating Minimal Defensive Alliances
par: Feng, Zhidan, et autres
Publié: (2023)

Counting Subgraphs in Somewhere Dense Graphs
par: Bressan, Marco, et autres
Publié: (2022)

Three Hardness Results for Graph Similarity Problems
par: Sun, He, et autres
Publié: (2023)

Infinitely growing configurations in Emil Post's tag system problem
par: Kurilenko, Nikita V.
Publié: (2021)

The Parameterized Complexity of Terminal Monitoring Set
par: Aravind, N. R., et autres
Publié: (2024)

Maximal Line Digraphs
par: Japhet, Quentin, et autres
Publié: (2024)

Inapproximability of the independent set polynomial in the complex plane
par: Bezakova, Ivona, et autres
Publié: (2017)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
par: Carbonnel, Clément
Publié: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
par: Rai, Ashutosh, et autres
Publié: (2026)

Optimal Inapproximability of Promise Equations over Finite Groups
par: Butti, Silvia, et autres
Publié: (2024)

Parallel Repetition for $3$-Player XOR Games
par: Bhangale, Amey, et autres
Publié: (2024)

Complexity of Boolean automata networks under block-parallel update modes
par: Perrot, Kévin, et autres
Publié: (2024)

On the equivalence of two post-quantum cryptographic families
par: Meneghetti, Alessio, et autres
Publié: (2021)

Graphs without a partition into two proportionally dense subgraphs
par: Bazgan, Cristina, et autres
Publié: (2018)