Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
From MaRDI portal
Publication:2917350
DOI10.4230/OASIcs.CCA.2009.2277zbMath1247.03106arXiv0811.3782OpenAlexW2963496278MaRDI QIDQ2917350
Publication date: 28 September 2012
Full work available at URL: https://arxiv.org/abs/0811.3782
Analysis of algorithms and problem complexity (68Q25) Numerical linear algebra (65F99) Computation over the reals, computable analysis (03D78)
This page was built for publication: Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability