On the public citation graph

An Isomorphism Between Subexponential and Parameterized Complexity Theory

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1016/0168-0072(94)00034-zopenalex-snapshot
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/j.ic.2005.05.001openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.003openalex-snapshot
Bounded fixed-parameter tractability and log 2 n nondeterministic bits
inferredcites →https://doi.org/10.1016/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1016/j.tcs.2004.08.002openalex-snapshot
An improved deterministic local search algorithm for 3-SAT
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.003openalex-snapshot
On miniaturized problems in parameterized complexity theory
inferredcites →https://doi.org/10.1016/s0022-0000(03)00074-6openalex-snapshot
On the existence of subexponential parameterized algorithms
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.3233/sat190005openalex-snapshot
Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_29openalex-snapshot
The M-Hierarchy, and XP-Optimality
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_48openalex-snapshot
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_30openalex-snapshot
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_11openalex-snapshot
Parameterized Complexity and Subexponential-Time Computability
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_9openalex-snapshot
A Basic Parameterized Complexity Primer
inferred← citeshttps://doi.org/10.1007/s00224-011-9381-0openalex-snapshot
Parameterized Random Complexity
inferred← citeshttps://doi.org/10.1007/s10472-016-9521-yopenalex-snapshot
Refining complexity analyses in planning by exploiting the exponential time hypothesis
inferred← citeshttps://doi.org/10.1016/j.artint.2017.01.005openalex-snapshot
An initial study of time complexity in infinite-domain constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100834openalex-snapshot
Parameterized inapproximability: From Clique to PIH
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.029openalex-snapshot
Parameterized and subexponential-time complexity of satisfiability problems and applications
inferred← citeshttps://doi.org/10.1093/logcom/exn029openalex-snapshot
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
inferred← citeshttps://doi.org/10.1137/10080703xopenalex-snapshot
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
inferred← citeshttps://doi.org/10.1142/9789812770998_0017openalex-snapshot
THE MEASURE HYPOTHESIS AND EFFICIENCY OF POLYNOMIAL TIME APPROXIMATION SCHEMES
inferred← citeshttps://doi.org/10.1145/1806689.1806723openalex-snapshot
Improving exhaustive search implies superpolynomial lower bounds
inferred← citeshttps://doi.org/10.1145/3618260.3649771openalex-snapshot
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.1145/3749982openalex-snapshot
Parameterized Inapproximability Hypothesis under ETH
inferred← citeshttps://doi.org/10.48550/arxiv.1206.2436openalex-snapshot
A Proof Checking View of Parameterized Complexity
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.