Results 1  10
of
204
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space
 In Proceedings, Twelfth Annual IEEE Conference on Computational Complexity
, 1996
"... We discuss the possibility of using the relatively old technique of diagonalization to separate complexity classes, in particular NL from NP. We show several results in this direction. ffl Any nonconstant level of the polynomialtime hierarchy strictly contains NL. ffl SAT is not simultaneously in ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
We discuss the possibility of using the relatively old technique of diagonalization to separate complexity classes, in particular NL from NP. We show several results in this direction. ffl Any nonconstant level of the polynomialtime hierarchy strictly contains NL. ffl SAT is not simultaneously
Improved separations between nondeterministic and randomized multiparty communication
 in Proc. of the 12th Intl. Workshop on Randomization and Computation (RANDOM
"... We exhibit an explicit function f: {0,1} n → {0,1} that can be computed by a nondeterministic numberonforehead protocol communicating O(logn) bits, but that requires n Ω(1) bits of communication for randomized numberonforehead protocols with k = δ · logn players, for any fixed δ < 1. Recent b ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We exhibit an explicit function f: {0,1} n → {0,1} that can be computed by a nondeterministic numberonforehead protocol communicating O(logn) bits, but that requires n Ω(1) bits of communication for randomized numberonforehead protocols with k = δ · logn players, for any fixed δ < 1. Recent
Nondeterministic NC¹ computation
"... We define the counting classes #NC¹, GapNC¹, PNC¹ and C=NC¹. We prove that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties. We ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
We define the counting classes #NC¹, GapNC¹, PNC¹ and C=NC¹. We prove that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties
Completeness for Nondeterministic Complexity Classes
, 1991
"... We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space classes. For time classes the studied completeness notions under polynomialtime bounded (even logarithmic space bounded) reducibilities turn out to be different for any class ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space classes. For time classes the studied completeness notions under polynomialtime bounded (even logarithmic space bounded) reducibilities turn out to be different for any
1. Nondeterministic Sequential Specifications
"... Nondeterministic Sequential (NDSeq) specifications have been proposed as a means for separating the testing, debugging, and verifying of a program’s parallelism correctness and its sequential functional correctness. In this work, we present a technique that, given a few representative executions of ..."
Abstract
 Add to MetaCart
Nondeterministic Sequential (NDSeq) specifications have been proposed as a means for separating the testing, debugging, and verifying of a program’s parallelism correctness and its sequential functional correctness. In this work, we present a technique that, given a few representative executions
Deterministic and NonDeterministic Stable Models
 Journal of Logic and Computation
, 1997
"... Stable models have been first introduced in the domain of total interpretations (T stable models), where the existence of multiple Tstable models for the same program provides a powerful mechanism to express nondeterminism. Stable models have been later extended to the domain of partial interpre ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
interpretations (Pstable models). In this paper, we show that the presence of multiple Pstable models need not be a direct manifestation of nondeterminism, for it can be instead an expression of assorted degrees of undefinedness. To separate the two factors, nondeterminism and undefinedness, this paper
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
Randomized versus Nondeterministic Communication Complexity
"... Our main result is the demonstration of a Boolean function f with nondeterministic and conondeterministic complexities O (log n) and cerror randomized complexity fl(log2 n), for O < c < 1/2. This is the first separation of this kind for a decision problem. 1 ..."
Abstract
 Add to MetaCart
Our main result is the demonstration of a Boolean function f with nondeterministic and conondeterministic complexities O (log n) and cerror randomized complexity fl(log2 n), for O < c < 1/2. This is the first separation of this kind for a decision problem. 1
Separating deterministic from nondeterministic NOF multiparty communication complexity (Extended Abstract)
 IN ICALP
, 2007
"... We solve some fundamental problems in the numberonforehead (NOF) kparty communication model. We show that there exists a function which has at most logarithmic communication complexity for randomized protocols with a onesided error probability of 1/3 but which has linear communication complexit ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
complexity for deterministic protocols. The result is true for k = n O(1) players, where n is the number of bits on each players ’ forehead. This separates the analogues of RP and P in the NOF communication model. We also show that there exists a function which has constant randomized complexity for public
Separating Functional and Parallel Correctness using Nondeterministic Sequential Specifications
"... Writing correct explicitlyparallel programs can be very challenging. While the functional correctness of a program can often be understood largely sequentially, a software engineer must simultaneously reason about the nondeterministic parallel interleavings of the program’s threads of execution. Th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Writing correct explicitlyparallel programs can be very challenging. While the functional correctness of a program can often be understood largely sequentially, a software engineer must simultaneously reason about the nondeterministic parallel interleavings of the program’s threads of execution
Results 1  10
of
204