Titlebook: Mathematical Foundations of Computer Science 1990; Banska Bystrica, Cze Branislav Rovan Conference proceedings 1990 Springer-Verlag Berlin

椭圆

One-way functions in complexity theory,able in polynomial time. We will examine relationships between the complexity of functional computational problems and ordinary set recognition problems. The complexity of inverting one-way functions will follow from these relationships. Then, we will survey various forms of one-way functions that h

overweight

instructive

On preemptive scheduling of periodic, real-time tasks on one processor, Simultaneous Congruences Problem is NP-complete in the strong sense. Although this result is included primarily as a lemma for showing our next major theorem, it is important in its own right, answering a question that has been open for ten years. Our second major result is perhaps the most importa

Nibble

Condense

Using inductive counting to simulate nondeterministic computation,with no space penalty any reasonable acceptance mechanism based on censuses of configurations. However, the efficiency with which other acceptance mechanisms can simulate nondeterminism remains an open question. This paper uses inductive counting to study the cost of simulating nondeterminism with V

四牛在弯曲

Some properties of zerotesting bounded one-way multicounter machines,chy of zerotesting bounded deterministic counter machine languages. Second, we show that a nondeterministic two-counter machine with 2 zerotests is able to recognize a language which cannot be accepted by any deterministic sublinear zerotesting bounded multicounter machine.

刚毅

Decomposition of semi commutations, of the alphabet. We prove that semi commutations can be decomposed in weaker semi commutations if and only if they are not atomic. We then deduce that every semi commutation can be obtained by a composition of atomic semi commutations and we suggest a decomposition algorithm.

hysterectomy

飞镖

A logical operational semantics of full Prolog, as a result of the inherent extensibility of dynamic algebra semantics, we are able to proceed by stepwise refinement..We give this semantics for the full language of Prolog including all the usual non-logical built-in predicates. Our specific aim is to provide a mathematically precise but simple f

无能力之人