#### Filter Results:

#### Publication Year

1976

1988

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Nondeterminism is one of the most elusive concepts in computing.
In this paper we direct our efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with <underline>restricted</underline> amounts of nondeterminism.
… (More)

Introduction. Weak multivalued dependencies (WlVDs) mre introduced by Jaeschke ind Scheck in order to characterize when twc NEST operations on different single attributes muld conmute [JSI. Thomas extended this result to nesting cn arbitrary structures and also gave a graph-theoretic characterization [Tl. In this paper we give additional characterizations… (More)

Unnormalized relations permit components of tuples to be relation instances themselves instead of atomic values. Such structures do not always represent the restructuring of a flat (1NF) relation. It is shown that for one-level structures (nesting is permitted only over sets of attributes) there is a polynomial time algorithm to determine whether the… (More)

The procedure TANGENTS (P, m, p) accepts as its inputs a point p and a convex polygon P, given as a sequence of vertices beginning with m, also explicitly given. P is represented by means of an A VL tree T(P) modified so that each vertex Vi stores a pointer NEXT[vi] to the address of its successor Vi+l on the boundary of P. This modification is prompted by… (More)