Results 1  10
of
36
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2352 (12 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing results and asking new questions. We show that mNL (monotone nondeterministic logspace) is not closed under complementation, in contrast to Immerman's and Szelepcs 'enyi's nonmonotone result [Imm88, Sze87] that NL = coNL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for stconnectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained in mNC 1 , motivated by Barrington's result [Bar89] that BWBP = NC 1 . Although we cannot answer t...
A Theory of the Learnable
, 1984
"... Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from ..."
Abstract

Cited by 1699 (15 self)
 Add to MetaCart
Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from a computational viewpoint. It consists of choosing an appropriate information gathering mechanism, the learning protocol, and exploring the class of concepts that can be learnt using it in a reasonable (polynomial) number of steps. We find that inherent algorithmic complexity appears to set serious limits to the range of concepts that can be so learnt. The methodology and results suggest concrete principles for designing realistic learning systems.
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 230 (21 self)
 Add to MetaCart
this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach to complexity theory go back to 1974 when Fagin showed that the NP properties are exactly those expressible in second order existential sentences. It follows that second order logic expresses exactly those properties which are in the polynomial time hierarchy. We show that adding suitable transitive closure operators to second order logic results in languages capturing polynomial space and exponential time, respectively. The existence of such natural languages for each important complexity class sheds a new light on complexity theory. These languages reaffirm the importance of the complexity classes as much more than machine dependent issues. Furthermore a whole new approach is suggested. Upper bounds (algorithms) can be produced by expressing the property of interest in one of our languages. Lower bounds may be demonstrated by showing that such expression is impossible.
Boundedwidth polynomialsize branching programs recognize exactly those languages
 in NC’, in “Proceedings, 18th ACM STOC
, 1986
"... We show that any language recognized by an NC ’ circuit (fanin 2, depth O(log n)) can be recognized by a width5 polynomialsize branching program. As any boundedwidth polynomialsize branching program can be simulated by an NC ’ circuit, we have that the class of languages recognized by such prog ..."
Abstract

Cited by 213 (13 self)
 Add to MetaCart
We show that any language recognized by an NC ’ circuit (fanin 2, depth O(log n)) can be recognized by a width5 polynomialsize branching program. As any boundedwidth polynomialsize branching program can be simulated by an NC ’ circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC’. Further, following
The monotone circuit complexity of Boolean functions
 COMBINATORICA
, 1987
"... Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that lect cliques in graphs. In particular, Razborov showed that detecting cliques of size s in a graph dh m vertices requires monotone circuits of size.Q(m'/(log m) ~') for fixed s, and size rn ao°~') for,.:[log ml4J. I ..."
Abstract

Cited by 127 (4 self)
 Add to MetaCart
Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that lect cliques in graphs. In particular, Razborov showed that detecting cliques of size s in a graph dh m vertices requires monotone circuits of size.Q(m'/(log m) ~') for fixed s, and size rn ao°~') for,.:[log ml4J. In this paper we modify the arguments of Razborov to obtain exponential lower bounds for monotone circuits. In particular, detecting cliques of size (1/4) (m/log m) ~'/a requires monotone circuits f size exp (£2((m/log m)~/:~)). For fixed s, any monotone circuit that detects cliques of size s requires 'm'/(log m)') AND gates. We show that even a very rough approximation of the maximum clique e of a graph requires superpolynomial size monotone circuits, and give lower bounds for some net Boolean functions. Our best lower bound fi~r an NP function of n variables is exp (f2(n w4. (log n)~/~)), improving a recent result of exp (f2(nws')) due to Andreev.
HYPERTREE DECOMPOSITIONS AND TRACTABLE QUERIES
, 1998
"... Several important decision problems on conjunctive queries (CQs) are NPcomplete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean CQs and query containment. These problems were shown tracta ..."
Abstract

Cited by 127 (31 self)
 Add to MetaCart
Several important decision problems on conjunctive queries (CQs) are NPcomplete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean CQs and query containment. These problems were shown tractable for conjunctive queries of bounded treewidth [7], and of bounded degree of cyclicity [18, 17]. The so far most general concept of nearly acyclic queries was the notion of queries of bounded querywidth introduced by Chekuri and Rajaraman [7]. While CQs of bounded query width are tractable, it remained unclear whether such queries are efficiently recognizable. Chekuri and Rajaraman [7] stated as an open problem whether for each constant k it can be determined in polynomial time if a query has query width ≤ k. We give a negative answer by proving this problem NPcomplete (specifically, for k = 4). In order to circumvent this difficulty, we introduce the new concept of hypertree decomposition of a query and the corresponding notion of hypertree width. We prove: (a) for each k, the class of queries with query width bounded by k is properly contained in the class of queries whose hypertree width is bounded by k; (b) unlike query width, constant hypertreewidth is efficiently recognizable; (c) Boolean queries of constant hypertree width can be efficiently evaluated.
On Pseudorandomness and ResourceBounded Measure
 Theoretical Computer Science
, 1997
"... In this paper we extend a key result of Nisan and Wigderson [17] to the nondeterministic setting: for all ff ? 0 we show that if there is a language in E = DTIME(2 O(n) ) that is hard to approximate by nondeterministic circuits of size 2 ffn , then there is a pseudorandom generator that can be u ..."
Abstract

Cited by 46 (3 self)
 Add to MetaCart
In this paper we extend a key result of Nisan and Wigderson [17] to the nondeterministic setting: for all ff ? 0 we show that if there is a language in E = DTIME(2 O(n) ) that is hard to approximate by nondeterministic circuits of size 2 ffn , then there is a pseudorandom generator that can be used to derandomize BP \Delta NP (in symbols, BP \Delta NP = NP). By applying this extension we are able to answer some open questions in [14] regarding the derandomization of the classes BP \Delta \Sigma P k and BP \Delta \Theta P k under plausible measure theoretic assumptions. As a consequence, if \Theta P 2 does not have pmeasure 0, then AM " coAM is low for \Theta P 2 . Thus, in this case, the graph isomorphism problem is low for \Theta P 2 . By using the NisanWigderson design of a pseudorandom generator we unconditionally show the inclusion MA ` ZPP NP and that MA " coMA is low for ZPP NP . 1 Introduction In recent years, following the development of resourcebounded meas...
Complexity Models for Incremental Computation
, 1994
"... We present a new complexity theoretic approach to incremental computation. We define complexity classes that capture the intuitive notion of incremental efficiency and study their relation to existing complexity classes. We show that problems that have small sequential space complexity also have sma ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
We present a new complexity theoretic approach to incremental computation. We define complexity classes that capture the intuitive notion of incremental efficiency and study their relation to existing complexity classes. We show that problems that have small sequential space complexity also have small incremental time complexity. We show that all common LOGSPACEcomplete problems for P are also incrPOLYLOGTIMEcomplete for P. We introduce a restricted notion of completeness called NRPcompleteness and show that problems which are NRPcomplete for P are also incrPOLYLOGTIMEcomplete for P. We also give incrementally complete problems for NLOGSPACE, LOGSPACE, and nonuniform NC¹. We show that under certain restrictions problems which have efficient dynamic solutions also have efficient parallel solutions. We also consider a nonuniform model of incremental computation and show that in this model most problems have almost linear complexity. In addition, we present some techniques f...
The Complexity of Computation on the Parallel Random Access Machine
, 1993
"... PRAMs also approximate the situation where communication to and from shared memory is much more expensive than local operations, for example, where each processor is located on a separate chip and access to shared memory is through a combining network. Not surprisingly, abstract PRAMs can be much m ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
PRAMs also approximate the situation where communication to and from shared memory is much more expensive than local operations, for example, where each processor is located on a separate chip and access to shared memory is through a combining network. Not surprisingly, abstract PRAMs can be much more powerful than restricted instruction set PRAMs. THEOREM 21.16 Any function of n variables can be computed by an abstract EROW PRAM in O(log n) steps using n= log 2 n processors and n=2 log 2 n shared memory cells. PROOF Each processor begins by reading log 2 n input values and combining them into one large value. The information known by processors are combined in a binarytreelike fashion. In each round, the remaining processors are grouped into pairs. In each pair, one processor communicates the information it knows about the input to the other processor and then leaves the computation. After dlog 2 ne rounds, one processor knows all n input values. Then this processor computes th...
Symmetric Logspace is Closed Under Complement
 CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE
, 1994
"... We present a Logspace, manyone reduction from the undirected stconnectivity problem to its complement. This shows that SL = co  SL. ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
We present a Logspace, manyone reduction from the undirected stconnectivity problem to its complement. This shows that SL = co  SL.