<?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-22T14:24:50Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5455" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5455</identifier><datestamp>2017-03-21T20:11:21Z</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="37db6bfe-ca62-483c-9f9b-bd1631749ec9" confidence="600">Tilak, Hrushikesh</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-08-31T20:09:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-08-31T20:09:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-08-31T20:09:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010-08-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5455</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We consider the problem of finding a sparse multiple of a polynomial. Given&#xd;
a polynomial f ∈ F[x] of degree d over a field F, and a desired sparsity&#xd;
t = O(1), our goal is to determine if there exists a multiple h ∈ F[x] of f&#xd;
such that h has at most t non-zero terms, and if so, to find such an h.&#xd;
When F = Q, we give a polynomial-time algorithm in d and the size of&#xd;
coefficients in h. For finding binomial multiples we prove a polynomial bound&#xd;
on the degree of the least degree binomial multiple independent of coefficient&#xd;
size.&#xd;
When F is a finite field, we show that the problem is at least as hard as&#xd;
determining the multiplicative order of elements in an extension field of F&#xd;
(a problem thought to have complexity similar to that of factoring integers),&#xd;
and this lower bound is tight when t = 2.</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">complexity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">polynomial</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">sparse</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">multiple</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">lowerbound</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Computing sparse multiples of polynomials</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>