Skip to search formSkip to main contentSkip to account menu

Parameterized complexity

Known as: FPT (complexity class), Fixed-parameter tractability, W(2) 
In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
1-planar graph2-satisfiabilityAlgorithmic paradigmBarrier resilience

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Complexity of Shift Bribery in Iterative Elections
In iterative voting systems, candidates are eliminated in consecutive rounds until either a fixed number of rounds is reached or… 
2013
2013
Effect of the presence of epoxy spacer on transmission rate of electromagnetic wave propagating through T-branch of 66 kV GIS model tank
This paper deals with the influence of the presence of the epoxy spacer on the transmission rate of partial discharge (PD… 
2009
2009
Unequivocal resolution of multiplets in MR spectra for prostate cancer diagnostics achieved by the fast Padé transform
We perform mathematical modeling with the fast Padé transform (FPT) according to magnetic resonance (MR)-time signals as encoded… 
2009
2009
An FPGA-based Sudoku Solver based on Simulated Annealing methods
The Sudoku Simulated Annealing Solver -SSAS is a probabilistic Sudoku solver. The general design is capable of solving a Sudoku… 
2006
2006
A "soft++" eFPGA physical design approach with case studies in 180nm and 90nm
Our recent work in embedded FPGAs has been focused on a soft IP approach where programmable fabrics are described at the RTL… 
Highly Cited
2004
Highly Cited
2004
A parameterized polyhedra approach for explicit constrained predictive control
The elaboration of an explicit description for the constrained model based predictive control laws is a useful alternative to the… 
2004
2004
Young Children's Behavioral Problems in Married and Cohabiting Families
We use data from the Fragile Families Study (N = 1,370) to examine child behavioral problems among children born to cohabiting… 
2003
2003
CONTRIBUTIONS TO PARAMETERIZED COMPLEXITY
This thesis is presented in two parts. In Part One we concentrate on algorithmic aspects of parameterized complexity. We explore… 
2003
2003
On Exact and Approximation Algorithms for Distinguishing Substring Selection
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad… 
Highly Cited
1985
Highly Cited
1985
Helical Gears With Circular Arc Teeth: Simulation of Conditions of Meshing and Bearing Contact
Engrenages helicoidaux avec denture en arc de cercle. Simulation du contact et de l'engrenement 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)