Results 1  10
of
12,470
Nondeterministic quantum query and communication complexities
 SIAM JOURNAL ON COMPUTING
, 2003
"... We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x) = 1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its “nondeterministic poly ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
polynomial ” degree. We also prove a quantumvs.classical gap of 1 vs. n for nondeterministic query complexity for a total function. In the setting of communication complexity, we show that the nondeterministic quantum complexity of a twoparty function is equal to the logarithm of the rank of a
Nondeterministic quantum query and . . .
 SIAM J. COMPUT.
, 2003
"... We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x i f(x) = 1. In the setting of query omplexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its \nondeterministi
polynomi ..."
Abstract
 Add to MetaCart
We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x i f(x) = 1. In the setting of query omplexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its \nondeterministi
Characterization of nondeterministic quantum query and quantum communication complexity
 In Proceedings of the 15th Annual IEEE Conference on Computational Complexity
, 2000
"... It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the nondeterministic quantum query complexity of f is linearly re ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
related to the degree of a “nondeterministic ” polynomial for f. We also prove a quantumclassical gap of 1 vs. n for nondeterministic query complexity for a total f. In the case of quantum communication complexity there is a (partly undetermined) relation between the complexity of f and the logarithm
Quantum weakly nondeterministic communication complexity
 In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science
, 2006
"... Abstract. We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability 1 by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this model of quantum nondeterministic communication comp ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability 1 by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this model of quantum nondeterministic communication
Characterization of NonDeterministic Quantum Query and Quantum Communication Complexity
, 2000
"... It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the nondeterministic quantum query complexity of f is linearly re ..."
Abstract
 Add to MetaCart
related to the degree of a “nondeterministic ” polynomial for f. We also prove a quantumclassical gap of 1 vs. n for nondeterministic query complexity for a total f. In the case of quantum communication complexity there is a (partly undetermined) relation between the complexity of f and the logarithm
Characterization of NonDeterministic Quantum Query and Quantum Communication Complexity
"... It is known that the classical and quantum query complexities of a total Boolean functionfare polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the nondeterministic quantum query complexity offis linearly relate ..."
Abstract
 Add to MetaCart
related to the degree of a “nondeterministic ” polynomial forf. We also prove a quantumclassical gap of1 vs.nfor nondeterministic query complexity for a totalf. In the case of quantum communication complexity there is a (partly undetermined) relation between the complexity off and the logarithm
Exokernel: An Operating System Architecture for ApplicationLevel Resource Management
, 1995
"... We describe an operating system architecture that securely multiplexes machine resources while permitting an unprecedented degree of applicationspecific customization of traditional operating system abstractions. By abstracting physical hardware resources, traditional operating systems have signifi ..."
Abstract

Cited by 724 (24 self)
 Add to MetaCart
Aegis operations are 10–100 times faster than Ultrix,a mature monolithic UNIX operating system. ExOS implements processes, virtual memory, and interprocess communication abstractions entirely within a library. Measurements show that ExOS’s applicationlevel virtual memory and IPC primitives are 5
The Architecture of Cognition
, 1983
"... Spanning seven orders of magnitude: a challenge for ..."
Abstract

Cited by 1580 (40 self)
 Add to MetaCart
Spanning seven orders of magnitude: a challenge for
An introduction to variational methods for graphical models
 TO APPEAR: M. I. JORDAN, (ED.), LEARNING IN GRAPHICAL MODELS
"... ..."
Results 1  10
of
12,470