Cover Image

Parameterized complexity of the f-Critical Set problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Marcilon, Thiago, Silva, Murillo Inácio da Costa
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity 03D15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

On complexity of substructure connectivity and restricted connectivity of graphs
by: Lü, Huazhong, et al.
Published: (2021)

Correspondences in computational and dynamical complexity I
by: Everett, Samuel
Published: (2026)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

A Minimal Substitution Basis for the Kalmár Elementary Functions
by: Prunescu, Mihai, et al.
Published: (2025)

Separation of PSPACE and EXP
by: Czerwinski, Reiner
Published: (2021)

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
by: Boche, Holger, et al.
Published: (2024)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
by: Tzameret, Iddo, et al.
Published: (2023)

Deciding winning strategies in Yu-Gi-Oh! TCG is hard
by: Nicolosi, Orazio, et al.
Published: (2026)

A study of distributional complexity measures for Boolean functions
by: Köhler-Schindler, Laurin, et al.
Published: (2024)

The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)

Results on three problems on isolation of graphs
by: Borg, Peter, et al.
Published: (2026)

The Optimizer Quotient and the Certification Trilemma
by: Simas, Tristan
Published: (2026)

Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2024)

The complexity of convexity number and percolation time in the cycle convexity
by: Lima, Carlos V. G. C., et al.
Published: (2024)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
by: Mucke, Tom, et al.
Published: (2024)

Open Problems in Computability Theory and Descriptive Set Theory
by: Barmpalias, George, et al.
Published: (2025)

Hilbert's tenth problem for rings of holomorphic functions of bounded order
by: Pasten, Hector
Published: (2024)

Automatic structures and the problem of natural well-orderings
by: Beklemishev, Lev D., et al.
Published: (2024)

Recurrence solution of monomer-polymer models on two-dimensional rectangular lattices
by: Kong, Yong
Published: (2024)

A note reviewing Turing's 1936
by: Cattabriga, Paola
Published: (2013)

Computational Complexity of Model-Checking Quantum Pushdown Systems
by: Lin, Deren, et al.
Published: (2025)

Scott sentence complexities of linear orderings
by: Gonzalez, David, et al.
Published: (2023)

Proofs of NP = coNP = PSPACE: Current upgrade
by: Gordeev, Lev, et al.
Published: (2023)

Resource bounded Kučera-Gács Theorems
by: Nandakumar, Satyadev, et al.
Published: (2026)

Computable thermodynamic formalism
by: Binder, Ilia, et al.
Published: (2025)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

Computability properties of hyperbolic complex Hénon maps
by: Boyd, Suzanne, et al.
Published: (2026)

Dichotomy results for classes of countable graphs
by: Cipriani, Vittorio, et al.
Published: (2025)

Formalizing Pfaffian in bounded arithmetic
by: Kuroda, Satoru
Published: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
by: Wilken, Gunnar
Published: (2025)

Fundamental sequences based on localization
by: Wilken, Gunnar
Published: (2024)