<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">K. J. Lieberherr</style></author><author><style face="normal" font="default" size="100%">S. A. Vavasis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">A. B. Cremers</style></author><author><style face="normal" font="default" size="100%">H. P. Kriegel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis of polynomial approximation algorithms for constraint expressions</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science: 6th GI conference, Dortmund</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">1982</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin</style></pub-location><volume><style face="normal" font="default" size="100%">145</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>