Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Thomas O'Neil:

TR15-157 | 1st September 2015
Thomas O'Neil

Representation-Independent Fixed Parameter Tractability for Vertex Cover and Weighted Monotone Satisfiability

A symmetric representation for a set of objects requires the same amount of space for the set as for its complement. Complexity classifications that are based on the length of the input can depend on whether the representation is symmetric. In this article we describe a symmetric representation scheme for ... more >>>

ISSN 1433-8092 | Imprint