DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ziegler, Martin A | ko |
dc.contributor.author | Férée, Hugo | ko |
dc.date.accessioned | 2019-06-10T00:10:04Z | - |
dc.date.available | 2019-06-10T00:10:04Z | - |
dc.date.created | 2019-06-10 | - |
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, MACIS 2015, pp.489 - 504 | - |
dc.identifier.uri | http://hdl.handle.net/10203/262481 | - |
dc.description.abstract | The Lebesgue integration has been related to polynomial counting complexity in several ways, even when restricted to smooth functions. We prove analogue results for the integration operator associated with the Cantor measure as well as a more general second-order #P#P-hardness criterion for such operators. We also give a simple criterion for relative polynomial time complexity and obtain a better understanding of the complexity of integration operators using the Lebesgue decomposition theorem. | - |
dc.language | English | - |
dc.publisher | Springer International Publishing | - |
dc.title | On the computational complexity of positive linear functionals on C[0;1] | - |
dc.type | Conference | - |
dc.identifier.scopusid | 2-s2.0-84964070564 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 489 | - |
dc.citation.endingpage | 504 | - |
dc.citation.publicationname | 6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 | - |
dc.identifier.conferencecountry | GE | - |
dc.identifier.conferencelocation | Berlin | - |
dc.identifier.doi | 10.1007/978-3-319-32859-1_42 | - |
dc.contributor.localauthor | Ziegler, Martin A | - |
dc.contributor.nonIdAuthor | Férée, Hugo | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.