scispace - formally typeset
Search or ask a question

Showing papers in "Journal of Computer and System Sciences in 1992"


Journal ArticleDOI
TL;DR: It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism.

492 citations


Journal ArticleDOI
TL;DR: It is proved that almost every problem decidable in exponential space has essentially maximum circuit-size and space-bounded Kolmogorov complexity almost everywhere, and it is shown that infinite pseudorandom sequences have high nonuniform complexityalmost everywhere.

291 citations


Journal ArticleDOI
TL;DR: In this paper, the authors prove lower bounds of the form Ω(n · c−k), for the number of bits that need to be exchanged in order to compute some (explicitly given) polynomial time computable functions.

282 citations


Journal ArticleDOI
TL;DR: A worst-case analysis shows that direct input to output connections in threshold nets double the recognition but not the interpolation power, while using sigmoids rather than thresholds allows doubling both.

179 citations


Journal ArticleDOI
TL;DR: The scope of the theory of average case complexity is widened to other basic questions in computational complexity, and definitions and basic theorems regarding other complexity classes such as average log-space are provided.

179 citations


Journal ArticleDOI
TL;DR: Several characterizations are given of the regular languages in the circuit complexity class AC 0, thus answering a question of Chandra, Fortune, and Lipton, and to determine effectively whether a given regular language is in AC 0 and to solve in part an open problem originally posed by McNaughton.

122 citations


Journal ArticleDOI
Tomás Feder1
TL;DR: This approach builds on structural properties of these networks and exposes close ties with the theory of retracts and isometric embeddings for product graphs, which gives new efficient algorithms for questions of representation, enumeration, and optimization in stable matching.

121 citations


Journal ArticleDOI
TL;DR: The authors prove an Approximation Theorem, which holds in all topological models, thatTopological models are not complete w.r.t. λ-calculus.

93 citations


Journal ArticleDOI
TL;DR: In this article, it was shown that many other induction principles can be viewed as particular ways to obtain computable approximations to it, such as Gold's paradigm for inductive inference, Rissanen's minimum description length (MDL) principle, Fisher's maximum likelihood principle, and Jaynes' maximum entropy principle.

89 citations


Journal ArticleDOI
TL;DR: This paper investigates subclasses of NP that are low for complexity classes not known to be in the polynomial time hierarchy, and shows results that exploit the fact that the machines for these classes have a bounded number of accepting computation paths.

73 citations


Journal ArticleDOI
TL;DR: A hierarchical graph model is discussed that allows to exploit the hierarchical description of the graphs for the efficient solution of graph problems.

Journal ArticleDOI
TL;DR: The self-similar structure of the limit set by a transition matrix, whose maximum eigenvalue determines its Hausdorff dimension is characterized, which considerably simplifies the calculation of dimensions of limit sets.

Journal ArticleDOI
TL;DR: Positive results are obtained: a parallel algorithm for circuit value that runs in time about the square root of the number of gates, a linear-time sequential algorithm for network stability, and logspace reductions between circuit value and network stability.

Journal ArticleDOI
TL;DR: It is proved that there is an oracle A such that every two disjoint sets in NP A are P-separable, and Σ 2 P = U DTIME(2 P )| p is a polynomial.

Journal ArticleDOI
Pascal Weil1
TL;DR: It is shown that the varieties of rational languages closed under products with counter are exactly the varieties that correspond via Eilenberg's theorem to the variety of monoids closed under inverse LGsol-relational morphisms.

Journal ArticleDOI
TL;DR: A general criterion, the asymptotic consistency criterion, for these DT models to inherit the dynamical behavior of their CT counterparts is derived and detailed instances of this criterion are established for several classes of neural networks.

Journal ArticleDOI
TL;DR: In this article, the authors define a language (FO + posHP) where HP is the Hamiltonian path operator, and show that a problem can be represented by a sentence of this language if and only if the problem is in NP.

Journal ArticleDOI
TL;DR: It is shown that with arbitrary cycles in can-create safety is undecidable, and it appears safety is decidable for the practically useful cases while undecidability results from undue laxity in authorizing creation.

Journal ArticleDOI
TL;DR: This work considers efficient simulations of mesh connected networks or good representations of array structures by hypercube machines and derives embeddings which minimize dilation, i.e., the maximum distance in the hypercube between images of adjacent points of G.

Journal ArticleDOI
TL;DR: In this article, it was shown that for d-regular n-vertex graphs, edge-universal traversal sequences have a lower bound of Ω(d2n2 + dn2 log(nd)), for 3 ⩽d⩽n3 − 2.

Journal ArticleDOI
TL;DR: It is proved that a finite state verifier can accept any recursively enumerable set both in the multi-prover submodel of Ben-or, Goldwasser, Kilian, and Wigderson, and in the noisy oracle sub model of Feige, Shamir, and Tennenholtz.

Journal ArticleDOI
TL;DR: A simple technique is given allowing translation of most known separation and containment results for complexity classes of the fixed partition model to the more difficult optimal partition model, where few results were previously known.


Journal ArticleDOI
TL;DR: This paper discusses in detail a bounded-fairness (or B- Fairness) theory applied to Petri Net (PN) models, and it is shown that structural B- fairness relations can be computed in polynomial time.

Journal ArticleDOI
TL;DR: Experimental evidence has shown continuous neural networks to be extremely fault-tolerant; in particular, their performance does not appear to be significantly impaired when precision is limited.

Journal ArticleDOI
TL;DR: This work considers various other extensions to the nested algebra, such as least fixpoint and programming constructs, and shows the query languages obtained to be equivalent to (a slight extension of) the powerset algebra, thus both emphasizing the naturalness and strength of the latter as a tool to manipulate nested relations, and indicating better ways to implement the powersset algebra.

Journal ArticleDOI
TL;DR: The study of communication complexity when the processors have limited work space is initiated, and the following trade-offs between the number C of communications steps and space S are proved.

Journal ArticleDOI
TL;DR: This work investigates some real time behaviour of a (discrete time) single server system with FCFS task scheduling with a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadline T.

Journal ArticleDOI
TL;DR: The first known pairing function 〈·, ·〉 is exhibited, which is computable in linear time and constant space, and it is conjecture that every monotone pairing function requires log space to compute on-line.

Journal ArticleDOI
TL;DR: It is proved that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is $AC^0$-equivalent with the general perfect matching problem for arbitrary graphs.