## An Improved Method for the Computation of Affine Lower Bound Functions for Polynomials

2003
##### Authors
Smith, Andrew Paul
##### Series
Konstanzer Schriften in Mathematik und Informatik; 188
Preprint
##### Abstract
In this paper we present a method for construction such affine lower bound functions for polynomials which requires the computation of slopes, the solution of a system of linear equations, and a sequence of back substitutions. This method in general requires fewer arithmetic operations and has lower complexity than our previous approach.
##### Subject (DDC)
004 Computer Science
##### Cite This
ISO 690GARLOFF, Jürgen, Andrew Paul SMITH, 2003. An Improved Method for the Computation of Affine Lower Bound Functions for Polynomials
BibTex
@unpublished{Garloff2003Impro-6213,
year={2003},
title={An Improved Method for the Computation of Affine Lower Bound Functions for Polynomials},
author={Garloff, Jürgen and Smith, Andrew Paul}
}

RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:16Z</dc:date>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:16Z</dcterms:available>
<dcterms:abstract xml:lang="eng">In this paper we present a method for construction such affine lower bound functions for polynomials which requires the computation of slopes, the solution of a system of linear equations, and a sequence of back substitutions. This method in general requires fewer arithmetic operations and has lower complexity than our previous approach.</dcterms:abstract>
<dc:contributor>Garloff, Jürgen</dc:contributor>
<dc:creator>Smith, Andrew Paul</dc:creator>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6213/1/preprint_188.pdf"/>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6213"/>
<dc:language>eng</dc:language>
<dcterms:issued>2003</dcterms:issued>
<dc:creator>Garloff, Jürgen</dc:creator>
<dc:rights>terms-of-use</dc:rights>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6213/1/preprint_188.pdf"/>
<dc:format>application/pdf</dc:format>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Smith, Andrew Paul</dc:contributor>
<dcterms:title>An Improved Method for the Computation of Affine Lower Bound Functions for Polynomials</dcterms:title>
</rdf:Description>
</rdf:RDF>

Yes