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

TL;DR: It is proved that one may simulate all Turing machines by such nets, and any multi-stack Turing machine in real time, and there is a net made up of 886 processors which computes a universal partial-recursive function.

TL;DR: This paper studies the complexity of teaching by considering a variant of the on-line learning model in which a helpful teacher selects the instances, and measures the teaching dimension by a combinatorial measure.

TL;DR: An interesting application of the graph compression result arises from the fact that several graph algorithms can be adapted to work with the compressed representation of the input graph, thereby improving the bound on their running times, particularly on dense graphs.

TL;DR: The Sleator-Tarjan competitive analysis of paging (Comm. ACM28 (1985), 202-208) gives us the ability to make strong theoretical statements about paging algorithms without making...

TL;DR: It is shown that the problem of learning a probably almost optimal weight vector for a neuron is so difficult that the minimum error cannot even be approximated to within a constant factor in polynomial time (unless RP = NP); the same hardness result is obtained for several variants of this problem.

TL;DR: A general scheme for extending the VC-dimension to the case n > 1 is presented, which defines a wide variety of notions of dimension in which all these variants of theVC-dimension, previously introduced in the context of learning, appear as special cases.

TL;DR: In this article, simple randomized algorithms for fault detection of finite state machines are presented. But they do not consider the fault detection problem of partially specified finite state machine (PSM) specifications.

TL;DR: This work settles an open problem, the inclusion problem for pattern languages, and is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalence problem.

TL;DR: The problem of learning boolean functions in query and mistake-bound models in the presence of irrelevant attributes is addressed and a large class of functions, including the set of monotone functions, is described, for which learnability does imply attribute-efficient learnability in this model.

TL;DR: This framework represents infinite temporal information by generalized tuples defined by linear repeating points and constraints on these points in terms of predicates definable in Presburger arithmetic and proves that relations formed from generalized tupled are closed under the operations of relational algebra.

TL;DR: The problem of deciding whether a configuration has a predecessor is shown to be NLOG-complete for one-dimensional cellular automata, and the question whether a target configuration occurs in the orbit of a source configuration may be P- complete, NP-complete or PSPACE-complete, depending on the type of cellular automaton.

TL;DR: This paper introduces a new approach to the logical definability of NP optimization problems by focusing on the ways in which the feasible solutions of the problems can be described using first-order formulae, and determines the relations between the various classes of optimization problems arising in this context.

TL;DR: It is shown, under reasonable complexity theoretic assumptions, that it is an undecidable problem to tell if a counting problem expressed in the framework is polynomial time computable or if it is approximable by a randomized polynometric time algorithm.

TL;DR: In this paper, it was shown that a DNF with terms of size at most d can be approximated by a function at most O(d log 1/ε ) nonzero Fourier coefficients such that the expected error squared, with respect to the unifo...

TL;DR: The middle bit of ?

TL;DR: It is shown that any bounded-width branching program computing a nonconstant threshold function has length ?

TL;DR: It is shown that small packets of negative information also lead to increased speed of learning, which agrees with a psycholinguistic hypothesis of McNeill correlating the availability of parental expansions with the speed of child language development.

TL;DR: These results show that the structural complexity of USAT and of DP many-one complete sets are very similar, and so they lend support to the argument that even sets complete under "weak" randomized reductions can capture the properties of the many- one complete sets.

TL;DR: It is shown that themonotone analogue of logspace computation is more powerful than monotone log-depth circuits: monot one bounded fanin circuits for a certain function in monotones logspace require depth ?

TL;DR: In this paper, lower bounds on the number of samples and computational resources required to learn several classes of boolean circuits on the uniform distribution were investigated under the assumption that the distribution is uniform.

TL;DR: It is proved that it is much harder to evaluate depth-2, size-N circuits with MOD m gates than with MOD p gates by k-party communication protocols, which implies that if there is a prime p between k and k?

TL;DR: This work considers the problem of evaluating circuits, formulas, and words, over both nonassociative structures themselves and over matrices with elements in these structures, and shows that such problems can characterize a wide variety of complexity classes up to and including NP.

TL;DR: It is shown that there are natural NP-complete problems which are not polynomially isomorphic when instances are chosen at random because no polynomial-time isomorphisms can preserve the underlying natural distributions on instances of these problems.

TL;DR: This thesis believes that the ability to achieve some form of witness reduction is what makes a function hard for a class of functions.

TL;DR: An optimal algorithm for solving the scheduling problem when the execution cost of the system tasks is identical and equal to the communication cost between any pair of processors is introduced.

TL;DR: A main result of the paper is that interactive proof systems in which the Prover is restricted to a polynomial size strategy are equivalent to MA, Merlin-Arthur games, defined by Babai and Moran.

TL;DR: A logical characterization of natural subhierarchies of the dot-depth hierarchy refining a theorem of Thomas and a congruence characterization related to a version of the Ehrenfeucht-Fra??sse game generalizing a theorem on tree hierarchies of monoids are given.

TL;DR: The goal is to prove statements of the kind: "Given two complexity classes C and D, C = D if and only if for every sparse set S, CS = DS."