Titlebook: Algorithms and Computation; 7th International Sy Tetsuo Asano,Yoshihide Igarashi,Subhash Suri Conference proceedings 1996 Springer-Verlag B

senile-dementia

OBDDs of a monotone function and of its prime implicants, In other words, we cannot obtain the OBDD of the prime implicant set of a monotone function in an output-size sensitive manner, once we have constructed the OBDD of that function as in [3], in the worst case. A positive result is also given for a meaningful class of matroid functions.

Flawless

Recursively divisible problems,-divisible in a work-optimal way. On the other hand, we also provide some results of lower bound type. For example, ideally divisible problems appear to be a proper subclass of the functional complexity class . of sequentially feasible problems. Finally, we also give some extensions and variations of the concept of (.)-divisibility.

小說(shuō)

0302-9743 pan, in December 1996..The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searchin

發(fā)源

全面

Limited

ineptitude

eustachian-tube

https://doi.org/10.1007/978-3-8350-5409-7diameter of . and the length of the shortest line segment is bounded by a constant. We also give an .(. log .)-time algorithm to determine a set of lines shattering ., improving (for this setting) the .(.. log .) time algorithm of Freimer, Mitchell and Piatko.

臆斷

https://doi.org/10.1007/978-3-642-79619-7ction is either . or ., and the conditional functions are additive, where a function . is additive . extending a function . on ., and quotient if it is represented as a quotient of two additive functions. We use computational-geometric methods such as convex hull, range searching, and multidimensional divide-and-conquer.

GIDDY