Special issue: Algorithms and complexity for continuous problems. Seminar, Dagstuhl, Germany, September 24--29, 2000

DOI10.1006/JCOM.2002.0646zbMATH Open1001.00033OpenAlexW2911761156MaRDI QIDQ700168FDOQ700168

Authors:

Publication date: 30 September 2002

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

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

zbMATH Keywords

AlgorithmsComplexitySeminarSpecial issueDagstuhl (Germany)Papers

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Proceedings of conferences of miscellaneous specific interest (00B25)

Cited In (6)

• Special issue: Proceedings of ALGORITMY 2000, conference on scientific computing, Tatra Mountains, Podbanske, Slovakia, September 10--15, 2000
• Mt. Holyoke conference on continuous algorithms and complexity, June 11- 17, 1994, South Hadley, MA, USA
• Title not available (Why is that?)
• Special issue: Computability and complexity in analysis. Papers of a seminar, German Computer Science Center at Castle Dagstuhl, Germany, November 1999
• Special issue: Complexity of multivariate problems. Papers of the workshop, Baptist Univ., Hong Kong, China, October 4--8, 1999
• Special issue: Selected papers of the 12th annual IEEE conference on computational complexity, Ulm, Germany, June 24--27, 1997

This page was built for publication: Special issue: Algorithms and complexity for continuous problems. Seminar, Dagstuhl, Germany, September 24--29, 2000

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700168)