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

TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.

TL;DR: A technical lemma of independent interest is bounding the success probability of a computationally unbounded adversary in distinguishing between a random ml-bit to l-bit function and the CBC MAC of a random l- bit to l -bit function.

TL;DR: Algorithms for computing this bisimulation equivalence classes as introduced by Larsen and Skou, the simulation preorder a la Segala and Lynch, and the reduction to maximum flow problems in suitable networks are presented.

TL;DR: A multiway cut is a subset of edges whose removal disconnects each terminal from the rest of the graph, given an undirected graph with edge costs and a set of k nodes called terminals.

TL;DR: This work presents spot-checkers for sorting, convex hull, element distinctness, set containment, set equality, total orders, and correctness of group and field operations and shows that the spot-checking model can be applied to problems in a wide range of areas, including problems regarding graphs, sets, and algebra.

TL;DR: It is shown that the attributed tree transducer with look-ahead is an appropriate implementation model for the tree transductions that are specifiable in mso logic and holds for mso graph transducers that produce trees with shared subtrees.

TL;DR: This paper solves several fundamental open problems about statistical zero-knowledge interactive proofs (SZKIPs) and proves that the complement of L has a statisticalzero-knowledge constant (one) round interactive proof against an honest verifier.

TL;DR: In this paper, the problems of global exponential stability and periodic solutions for a class of delayed cellular neural networks are analyzed via the method of constructing suitable Lyapunov functionals.

TL;DR: This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence, which extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises.

TL;DR: This work studies the problem of determining, for a class of functions H, whether an unknown target function f is contained in H or is “far” from any function in H, and demonstrates that the number of examples required for testing grows only as O(s1/2+?) (where ? is any small constant).

TL;DR: Two techniques for constructing sample spaces that approximate probability distributions are presented, including a construction of small probability spaces approximating general independent distributions which are of smaller size than the constructions of Even, Goldreich, Luby, Nisan, and Veli?kovi?

TL;DR: This paper presents an algorithm which uses the ideas of Martel and has a 54 asymptotic worst-case ratio for the one-dimensional bin packing problem.

TL;DR: It is shown that the max directed vertex-disjoint paths problem cannot be approximated within ratio 2log1??n unless NP?DTIME2polylogn, the integer multicommodity flow problem in directed graphs cannot be approximation within ratios unless P=NP, and the minimum Steiner forest with bandwidth constraints problem can not be approximating within ratio exp(poly(n)) unless P =NP.

TL;DR: This paper presents a concept class of 1-decision lists and proves that while a computationally unbounded learner can learn the class from O(1) examples, under a standard cryptographic assumption any polynomial-time learner requires almost ?

TL;DR: The domain of attraction of memory patterns and the exponential convergence rate of the network trajectories to memory patterns for Hopfield continuous associative memory are estimated and can be used for the evaluation of fault-tolerance capability and the synthesis procedures forHopfield continuous feedback associativeMemory neural networks.

TL;DR: This work considers a new weaker hypothesis, namely the assumption that NP is not p-meager with respect to the resource bounded Baire category concept of Ambos-Spies et al, and proves this conjecture for the bounded-query reducibilities.

TL;DR: This paper identifies a subset of Z-cycles that has to be empty in order that the checkpoint and communication pattern of the execution satisfies the NZC property, and presents a communication-induced checkpointing protocol that prevents CZCs on-the-fly.

TL;DR: A relaxed version of AVL trees is described and it is proved that each update gives rise to at most a logarithmic number of rebalancing operations and that the number of rebate operations in the semidynamic case is amortized constant.

TL;DR: Methods for proving asymptotically optimal bounds are presented and applied to the solution of some basic problems concerning OBDDs and the worst case OBDD size of functions with a given number of 1-inputs is investigated.

TL;DR: Several variants of the basic scheme are presented, one of which requires no interaction between the recipient of the signature and the proxies to establish such a proof and one in which the reconstruction of the signer's signature by the proxies is completely non-interactive.

TL;DR: An analytic model for system reliability estimation based on the Markov chain is proposed and the results show that the proposed model obtains good estimation in various simulated real-time systems.

TL;DR: This work gives a complete picture of the tractability?intractability frontier in the propositional Horn theories under the familiar representation of Horn theories by Horn CNFs and under the recently proposed model-based representation in terms of the characteristic models.

TL;DR: The main result is to characterize differences between unbounded fan-in parallelism ACk, bounded fan- in parallelism NCk, and the sequential classes DSPACE(logn) and LOGDCFL in terms of a PRAM's communication structure and instruction set.

TL;DR: It is shown that the Smith et al (1999) model does not account for cup orientation, and suggested augmenting dynamics with conceptual/relational structure to account for this, and that behaviour is far too easily altered by extraneous events to be the result of some enduring structure corresponding to an object concept in infants, or even adults.