Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

TCS
1998

favoriteEmaildiscussreport

80views Theoretical Computer Science» more TCS 1998»

Parameterized Circuit Complexity and the W Hierarchy

13 years 3 months ago

Parameterized Circuit Complexity and the W Hierarchy

Download www.cse.buffalo.edu

Rodney G. Downey, Michael R. Fellows, Kenneth W. R

Real-time Traffic

TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Threshold Dominating Sets and an Improved Characterization of W2

» Parameterized Complexity Classes under Logical Reductions

» Determining the Winner of a Dodgson Election is Hard

» Tight Lower Bounds for Certain Parameterized NPHard Problems

» Hierarchical Interconnect Circuit Models

» The effect of girth on the kernelization complexity of Connected Dominating Set

» SEAMS Simulation Environment for VHDLAMS

» Sparse MatrixVector multiplication on FPGAs

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan

Comments (0)