<?xml version="1.0" encoding="UTF-8"?>
<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-07-22T00:07:45Z</responseDate>
  <request identifier="153" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:153</identifier>
        <datestamp>2024-03-06T11:05:56Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>04401 Summary – Algorithms and Complexity for Continuous Problems</dc:title>
          <dc:creator>Müller-Gronbach, Thomas</dc:creator>
          <dc:creator>Novak, Erich</dc:creator>
          <dc:creator>Petras, Knut</dc:creator>
          <dc:creator>Traub, Joseph F.</dc:creator>
          <dc:subject>Complexity and Regularization of Ill-Posed Problems</dc:subject>
          <dc:subject>Non-Linear Approximation</dc:subject>
          <dc:subject>Tractability of High-Dimensional Numerical Problems Quasi-Monte Carlo Methods</dc:subject>
          <dc:subject>Quantum Computing</dc:subject>
          <dc:subject>Stochastic Computation and Quantization</dc:subject>
          <dc:subject>Global Optimization</dc:subject>
          <dc:subject>Differential and Integral Equation</dc:subject>
          <dc:description>The goal of this workshop was to bring together&#13;
researchers from different communities working on&#13;
computational aspects of continuous problems.&#13;
Continuous computational problems arise in many&#13;
areas of science and engineering. Examples include&#13;
path and multivariate integration, function&#13;
approximation, optimization, as well as&#13;
differential, integral, and operator equations.&#13;
Understanding the complexity of such problems and&#13;
constructing efficient algorithms is both&#13;
important and challenging.&#13;
The workshop was of a very interdisciplinary&#13;
nature with invitees from, e.g., computer science,&#13;
numerical analysis, discrete, applied, and pure&#13;
mathematics, physics, statistics, and scientific&#13;
computation. Many of the lectures were presented&#13;
by Ph.D. students.&#13;
Compared to earlier meetings, several very active&#13;
research areas received more emphasis. These&#13;
include Quantum Computing, Complexity and&#13;
Tractability of high-dimensional problems,&#13;
Stochastic Computation, and Quantization, which&#13;
was an entirely new field for this workshop.&#13;
Due to strong connections between the topics&#13;
treated at this workshop many of the participants&#13;
initiated new cooperations and research projects.&#13;
For more details, see the pdf-file with the same&#13;
title.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thomas Müller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04401.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1530</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
