There exists a linear problem with infinite combinatory complexity

DOI10.1006/JCOM.1993.1021zbMath0778.68047OpenAlexW2008703086MaRDI QIDQ1260663

Grzegorz W. Wasilkowski, Henryk Woźniakowski

Publication date: 24 August 1993

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

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

zbMATH Keywords

information complexityworst case settingcombinatory complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (1)

The quantum setting with randomized queries for continuous problems

This page was built for publication: There exists a linear problem with infinite combinatory complexity