Results 1  10
of
102
Nondeterministic Space is Closed Under Complementation
, 1988
"... this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the contextsensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4 ..."
Abstract

Cited by 240 (15 self)
 Add to MetaCart
this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the contextsensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4] for a discussion of the history and importance of this problem, and Hopcroft and Ullman [5] for all relevant background material and definitions. The history behind the proof is as follows. In 1981 we showed that the set of firstorder inductive definitions over finite structures is closed under complementation [6]. This holds with or without an ordering relation on the structure. If an ordering is present the resulting class is P. Many people expected that the result was false in the absence of an ordering. In 1983 we studied firstorder logic, with ordering, with a transitive closure operator. We showed that NSPACE[log n] is equal to (FO + pos TC), i.e. firstorder logic with ordering, plus a transitive closure operation, in which the transitive closure operator does not appear within any negation symbols [7]. Now we have returned to the issue of complementation in the light of recent results on the collapse of the log space hierarchies [10, 2, 14]. We have shown that the class (FO + pos TC) is closed under complementation. Our
The quantitative structure of exponential time
 Complexity Theory Retrospective II
, 1997
"... ..."
Counting quantifiers, successor relations, and logarithmic space
 Journal of Computer and System Sciences
, 1997
"... ..."
Two applications of inductive counting for complementation problems
 SIAM Journal of Computing
, 1989
"... nondeterministic spacebounded complexity classes are closed under complementation, two further applications of the inductive counting technique are developed. First, an errorless probabilistic algorithm for the undirected graph st connectivity problem that runs in O(log n) space and polynomial exp ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
nondeterministic spacebounded complexity classes are closed under complementation, two further applications of the inductive counting technique are developed. First, an errorless probabilistic algorithm for the undirected graph st connectivity problem that runs in O(log n) space and polynomial expected time is given. Then it is shown that the class LOGCFL is closed under complementation. The latter is a special case of a general result that shows closure under complementation of classes defined by semiunbounded fanin circuits (or, equivalently, nondeterministic auxiliary pushdown automata or treesize bounded alternating Turing machines). As one consequence, it is shown that small numbers of "role switches " in twoperson pebbling can be eliminated.
On PolynomialTime Bounded TruthTable Reducibility of NP Sets to Sparse Sets
, 1991
"... We prove that if P ≠ NP, then there exists a set in NP that is not polynomial time bounded truthtable reducible (in short, p btt reducible) to any sparse set. In other words, we prove that no sparse p btt hard set exists for NP unless P = NP. By using the technique proving this result, w ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
We prove that if P &ne; NP, then there exists a set in NP that is not polynomial time bounded truthtable reducible (in short, p btt reducible) to any sparse set. In other words, we prove that no sparse p btt hard set exists for NP unless P = NP. By using the technique proving this result, we investigate intractability of several number theoretic decision problems, i.e., decision problems defined naturally from number theoretic problems. We show that for these number theoretic decision problems, if it is not in P, then it is not p btt reducible to any sparse set.
Measure, stochasticity, and the density of hard languages
 Proceedings of the Tenth Symposium on Theoretical Aspects of Computer Science
, 1993
"... The main theorem of this paper is that, for every real number <1 (e.g., = 0:99), only a measure 0 subset of the languages decidable P in exponential time are n;ttreducible to languages that are not P exponentially dense. Thus every n;tthard language for E is exponentially dense. This strengthe ..."
Abstract

Cited by 41 (14 self)
 Add to MetaCart
The main theorem of this paper is that, for every real number <1 (e.g., = 0:99), only a measure 0 subset of the languages decidable P in exponential time are n;ttreducible to languages that are not P exponentially dense. Thus every n;tthard language for E is exponentially dense. This strengthens Watanabe's 1987 result, that every P O(log n);tthard language for E is exponentially dense. The combinatorial technique used here, the sequentially most frequent query selection, also gives a new, simpler proof of Watanabe's result. The main theorem also has implications for the structure of NP under strong hypotheses. Ogiwara and Watanabe (1991) have shown P that the hypothesis P 6 = NP implies that every btthard language for NP is nonsparse (i.e., not polynomially sparse). Their technique does not appear to allow signi cant relaxation of either the query bound or the sparseness criterion. It is shown here that a stronger hypothesis namely, that NP does not have measure 0 in exponential timeimplies P the stronger conclusion that, for every real <1, every n;tthard language for NP is exponentially dense. Evidence is presented that this stronger hypothesis is reasonable. The proof of the main theorem uses a new, very general weak stochasticity theorem, ensuring that almost every language in E is statistically unpredictable by feasible deterministic algorithms, even How dense must a language A f0 � 1g be in order to be hard for a complexity class C? The ongoing investigation of this question, especially important
The Isomorphism Conjecture Fails Relative to a Random Oracle
 J. ACM
, 1996
"... Berman and Hartmanis [BH77] conjectured that there is a polynomialtime computable isomorphism between any two languages complete for NP with respect to polynomialtime computable manyone (Karp) reductions. Joseph and Young [JY85] gave a structural definition of a class of NPcomplete setsthe kc ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
Berman and Hartmanis [BH77] conjectured that there is a polynomialtime computable isomorphism between any two languages complete for NP with respect to polynomialtime computable manyone (Karp) reductions. Joseph and Young [JY85] gave a structural definition of a class of NPcomplete setsthe kcreative setsand defined a class of sets (the K k f 's) that are necessarily kcreative. They went on to conjecture that certain of these K k f 's are not isomorphic to the standard NPcomplete sets. Clearly, the BermanHartmanis and JosephYoung conjectures cannot both be correct. We introduce a family of strong oneway functions, the scrambling functions. If f is a scrambling function, then K k f is not isomorphic to the standard NPcomplete sets, as Joseph and Young conjectured, and the BermanHartmanis conjecture fails. Indeed, if scrambling functions exist, then the isomorphism also fails at higher complexity classes such as EXP and NEXP. As evidence for the existence of scramb...
PSelective Sets, and Reducing Search to Decision vs. SelfReducibility
, 1993
"... We obtain several results that distinguish selfreducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6= E, then there exists a set L in NP \Gamma P such that search reduces to decision for L, search does not nonadaptively reduces to de ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
We obtain several results that distinguish selfreducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6= E, then there exists a set L in NP \Gamma P such that search reduces to decision for L, search does not nonadaptively reduces to decision for L, and L is not selfreducible. Funding for this research was provided by the National Science Foundation under grant CCR9002292. y Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 z Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 x Research performed while visiting the Department of Computer Science, State University of New York at Buffalo, Jan. 1992Dec. 1992. Current address: Department of Computer Science, University of ElectroCommunications, Chofushi, Tokyo 182, Japan.  Department of Computer Science, State University of New York at Buffalo, 226...
ResourceBounded Measure and Randomness
"... We survey recent results on resourcebounded measure and randomness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes and . Moreover, we treat timebounded genericity and stochasticity concepts which are weaker than ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
We survey recent results on resourcebounded measure and randomness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes and . Moreover, we treat timebounded genericity and stochasticity concepts which are weaker than timebounded randomness but which suffice for many of the applications in complexity theory.
Infeasibility of instance compression and succinct PCPs for NP
 Electronic Colloquium on Computational Complexity (ECCC
"... The ORSAT problem asks, given Boolean formulae φ1,..., φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction from ORSAT to any set A where the length of the output is bounded by a polynomial in n, unless NP ⊆ coNP/poly, and the PolynomialTi ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
The ORSAT problem asks, given Boolean formulae φ1,..., φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction from ORSAT to any set A where the length of the output is bounded by a polynomial in n, unless NP ⊆ coNP/poly, and the PolynomialTime Hierarchy collapses. This result settles an open problem proposed by Bodlaender et. al. [4] and Harnik and Naor [15] and has a number of implications. • A number of parametric NP problems, including Satisfiability, Clique, Dominating Set and Integer Programming, are not instance compressible or polynomially kernelizable unless NP ⊆ coNP/poly. • Satisfiability does not have PCPs of size polynomial in the number of variables unless NP ⊆ coNP/poly. • An approach of Harnik and Naor to constructing collisionresistant hash functions from oneway functions is unlikely to be viable in its present form. • (BuhrmanHitchcock) There are no subexponentialsize hard sets for NP unless NP is in coNP/poly. We also study probabilistic variants of compression, and show various results about and connections between these variants. To this end, we introduce a new strong derandomization hypothesis, the Oracle Derandomization Hypothesis, and discuss how it relates to traditional derandomization assumptions. Categories and Subject Descriptors