Simplifying the weft hierarchy

Authors:
Jonathan F. Buss;Tarique Islam
Affiliations:
School of Computer Science, University of Waterloo, Ont., Canada;School of Computer Science, University of Waterloo, Ont., Canada
Venue:
Theoretical Computer Science - Parameterized and exact computation
Year:
2006

Citing 3
Cited 3

On the Amount of Nondeterminism and the Power of Verifying

SIAM Journal on Computing
Fixed-Parameter Tractability, Definability, and Model-Checking

SIAM Journal on Computing
Parameterized Complexity

Parameterized Complexity

The complexity of fixed-parameter problems: guest column

ACM SIGACT News
Approximability and Parameterized Complexity of Minmax Values

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give simple, self-contained proofs of the basic hardness results for the classes W[t] of the weft hierarchy. We extend these proofs to higher levels of the hierarchy and illuminate the distinctions among its classes. The anti-monotone collapse at W[1, s] and the normalization of weft-t formulas arise as by-products of the proofs.