Ladner [3] ]has shown that the circuit value problem (CV) is log space complete for P, adding to the list of such problems found by Cook [iJ and Jones and Laaser [2]. Ladner's simulation of Turingâ€¦ (More)

A number of different models of synchronous, unbounded parallel computers have appeared in the literature. Without exception, runnmg time on these models has been shown to be polynomially related toâ€¦ (More)

A number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception, running time on these models has been shown to be polynomially relatedâ€¦ (More)

The effects of bases of two-input Boolean functions are characterized in terms of their impact on some questions in parallel computation. It is found that a certain set of bases (called theâ€¦ (More)

Area-time bounds on VLSI circuits for context-free language recognition, for the evaluation of propositional calculus formulae and for set equality and disjointness questions, are considered. In allâ€¦ (More)

The effect of É›-productions on the space complexity of various context-free language problems is investigated. It is shown that the removal of É›-productions from a context-free grammar can probablyâ€¦ (More)

We describe a gesture as an alternative for users to convey commands to the user interface. Issuing a command and manipulating an object can be done in one stroke. The number of our representationsâ€¦ (More)