Skip to main content
SpringerLink
Log in

Algorithms in the W-Hierarchy

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

    Jonathan F. Buss & Tarique Islam

Authors
  1. Jonathan F. Buss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tarique Islam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jonathan F. Buss or Tarique Islam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buss, J., Islam, T. Algorithms in the W-Hierarchy. Theory Comput Syst 41, 445–457 (2007). https://doi.org/10.1007/s00224-007-1325-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-1325-3

Keywords

Search

Navigation