<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:46:29Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3041" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3041</identifier><datestamp>2017-03-21T19:30:12Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="45fc2581-aaa8-4197-a69e-18899b211b29" confidence="600">Islam, Tarique</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-18T13:31:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-18T13:31:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-18T13:31:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3041</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Parameterized complexity theory relaxes the classical notion of tractability and&#xd;
allows to solve some classically hard problems in a reasonably efficient way. However, many problems of interest remain intractable in the context of parameterized&#xd;
complexity. A completeness theory to categorize such problems has been developed&#xd;
based on problems on circuits and Model Checking problems. Although a basic&#xd;
machine characterization was proposed, it was not explored any further.&#xd;
&#xd;
We develop a computational view of parameterized complexity theory based on&#xd;
resource-bounded programs that run on alternating random access machines. We&#xd;
develop both natural and normalized machine characterizations for the W[t] and&#xd;
L[t] classes. Based on the new characterizations, we derive the basic completeness results in parameterized complexity theory, from a computational perspective. Unlike the previous cases, our proofs follow the classical approach for showing basic NP-completeness results (Cook&amp;apos;s Theorem, in particular). We give new proofs of the Normalization Theorem by showing that (i) the computation of a resource-bounded program on an alternating RAM can be represented by instances of corre-&#xd;
sponding basic parametric problems, and (ii) the basic parametric problems can be&#xd;
decided by programs respecting the corresponding resource bounds. Many of the&#xd;
fundamental results follow as a consequence of our new proof of the Normalization&#xd;
Theorem. Based on a natural characterization of the W[t] classes, we develop new&#xd;
structural results establishing relationships among the classes in the W-hierarchy, and the W[t] and L[t] classes.&#xd;
Nontrivial upper-bound beyond the second level of the W-hierarchy is quite&#xd;
uncommon. We make use of the ability to implement natural algorithms to show&#xd;
new upper bounds for several parametric problems. We show that Subset Sum,&#xd;
Maximal Irredundant Set, and Reachability Distance in Vector Addition Systems (Petri Nets) are in W[3], W[4], and W[5], respectively. In some cases, the new bounds result in new completeness results. We derive new lower bounds based on the normalized programs for the W[t] and L[t] classes.&#xd;
We show that Longest Common Subsequence, with parameter the number of strings, is hard for L[t], t &amp;gt;= 1, and for W[SAT]. We also show that Precedence Constrained Multiprocessor Scheduling, with parameter the number of processors, is hard for L[t], t &amp;gt;= 1.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1031898 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">parameterized complexity</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Characterizing Hardness in Parameterized Complexity</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>