Titlebook: STACS 84; Symposium of Theoret M. Fontet,K. Mehlhorn Conference proceedings 1984 Springer-Verlag Berlin Heidelberg 1984 Alphabet.Informatik

巧办法

Approximation schemes for covering and packing problems in robotics and vlsi,le to derive algorithms that are the best possible in the sense that the exponential dependence on 1/ɛ cannot be removed unless NP=P. We also note that all other polynomial approximation schemes that we are familiar with rely on dynamic programming. The technique we introduced is an alternative to d

Estrogen

Covering polygons with minimum number of rectangles,ble number of rectangles. Let . be the set of all simple polygons with interior angles ≥ 90 degrees. Given a polygon . ε ., let .(.) be the minimum number of (possibly overlapping) rectangles lying within . necessary to cover ., and let r(.) be the ratio between the length of the longest edge of . a

coagulate

Corroborate

Ambulatory

MINT

引起痛苦

讨好美人

Higher order data structures,deas of Scott and Lambeck but in an abstract data type environment. The results serve as a basis for the discussion of higher order specifications. We demonstrate that higher order equations based on λ-calculus are more appropriate if the equivalence of λ-calculus and cartesian closure is to be pres

代理人

On the structure of polynomial time degrees,very countable distributive lattice can be embedded in any interval of degrees. Furthermore, certain restraints — like preservation of the least or greatest element — can be imposed on the embeddings. 2) The upper semilattice of polynomial time many-one degrees is distributive, whereas that of the p

信条

Transformations realizing fairness assumptions for parallel programs,ss are considered: impartiality, liveness, weak and strong fairness. All transformations preserve the structure of the original programs and are thus suitable as a basis for syntax-directed correctness proofs.