On the Query Complexity of Real Functionals

From MaRDI portal

Publication:5271045

Jump to:navigation, search

DOI10.1109/LICS.2013.15zbMath1366.03218MaRDI QIDQ5271045

Hugo Férée, Mathieu Hoyrup, Walid Gomaa

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

norm computational complexity computable analysis oracle Turing machine polynomial-time computable functional

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Computation over the reals, computable analysis (03D78)

Related Items (4)

Game semantics approach to higher-order complexity ⋮ Analytical properties of resource-bounded real functionals ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines

This page was built for publication: On the Query Complexity of Real Functionals

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5271045&oldid=19911239"