18306 search results - page 430 / 3662 » Algorithmics in Exponential Time |
200
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
187
Voted
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
233
click to vote
ECOOP
1997
Springer
15 years 11 months ago
1997
Springer
We propose a new model for exible composition of objects et of features. Features are similar to (abstract) subclasses, but only provide the core functionality of a (sub)class. Ove...
209
click to vote
TAPSOFT
1997
Springer
15 years 11 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
193
click to vote
APLAS
2007
ACM
15 years 11 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...