DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ziegler, Martin A. | ko |
dc.contributor.author | Schröder, Matthias | ko |
dc.contributor.author | Steinberg, Florian | ko |
dc.date.accessioned | 2019-06-10T00:30:09Z | - |
dc.date.available | 2019-06-10T00:30:09Z | - |
dc.date.created | 2019-06-10 | - |
dc.date.created | 2019-06-10 | - |
dc.date.issued | 2015-11-12 | - |
dc.identifier.citation | 6th International Conference on Mathematical Aspects of Computer and Information Sciences, pp.505 - 519 | - |
dc.identifier.uri | http://hdl.handle.net/10203/262483 | - |
dc.description.abstract | We introduce, and initiate the study of, average-case bitcomplexity theory over the reals: Like in the discrete case a first, naïve notion of polynomial average runtime turns out to lack robustness and is thus refined. Standard examples of explicit continuous functions with increasingly high worst-case complexity are shown to be in fact easy in the mean; while a further example is constructed with both worst and average complexity exponential: for topological/metric reasons, i.e., oracles do not help. The notions are then generalized from the reals to represented spaces; and, in the real case, related to randomized computation. | - |
dc.language | English | - |
dc.publisher | Springer International Publishing | - |
dc.title | Average-Case Bit-Complexity Theory of Real Functions | - |
dc.type | Conference | - |
dc.identifier.scopusid | 2-s2.0-84964047171 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 505 | - |
dc.citation.endingpage | 519 | - |
dc.citation.publicationname | 6th International Conference on Mathematical Aspects of Computer and Information Sciences | - |
dc.identifier.conferencecountry | GE | - |
dc.identifier.conferencelocation | Berlin | - |
dc.identifier.doi | 10.1007/978-3-319-32859-1_43 | - |
dc.contributor.localauthor | Ziegler, Martin A. | - |
dc.contributor.nonIdAuthor | Schröder, Matthias | - |
dc.contributor.nonIdAuthor | Steinberg, Florian | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.