Titlebook: Automata Theory and Formal Languages; 2nd GI Conference, K H. Brakhage Conference proceedings 1975 Springer-Verlag Berlin Heidelberg 1975 A

chandel

易怒

On the complexity of computations under varying sets of primitives,

gastritis

中子

Quantifier elimination for real closed fields by cylindrical algebraic decompostion,

項(xiàng)目

直覺(jué)好

,The complexity of negation-limited networks — A brief survey,lower bounds for monotone networks and the known gaps between the monotone and general combinational complexity indicate the key role that negations play in determining combinational complexity..We have investigated the way in which the complexity of a set of functions F decreases with the use of ad

HAIL

,Zur Entscheidbarkeit der funktionalen ?quivalenz,of the Grzegorczyk class ?. and of the polynominals over the integers formed with ? instead of -. Furthermore we show that the equivalence problem is solvable for the class L.(?1) of loop programs with the additional instruction X := X?1, but again unsolvable for the class L.(?1, +) and the Cleave-R

Crumple

晚間

Acetaminophen