Algorithms and complexity for continuous problems. Seminar, Dagstuhl invited papers. Dagstuhl, Germany, May 18--22, 1998

DOI10.1006/JCOM.1999.0507zbMath0937.00048OpenAlexW2025846997MaRDI QIDQ1961055

No author found.

Publication date: 18 May 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0507

zbMATH Keywords

AlgorithmsProceedingsSeminarComplexityDagstuhl (Germany)Continuous problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Sharp nonzero lower bounds for the Schur product theorem ⋮ Computational complexity of the integration problem for anisotropic classes

This page was built for publication: Algorithms and complexity for continuous problems. Seminar, Dagstuhl invited papers. Dagstuhl, Germany, May 18--22, 1998