28888 search results - page 102 / 5778 » Computability and complexity in analysis |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
COCO
1998
Springer
14 years 7 days ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
MLQ
2007
13 years 7 months ago
2007
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...