Titlebook: Algorithms and Computation; 5th International Sy Ding-Zhu Du,Xiang-Sun Zhang Conference proceedings 1994 Springer-Verlag Berlin Heidelberg

Medicaid

西瓜

轮流

https://doi.org/10.1007/978-3-642-91355-6h the regions may be covered by squares of different sizes, and for each input region we are given an upper bound on the size of the permissible square. We show that a simple extension of our heuristic is provably good in this case as well.

intoxicate

https://doi.org/10.1007/978-3-7091-7997-0nant. We show in the Boolean case that none of the complete problems can be recognized in .. unless .=.. On the other hand we show that even for problems which are hard to verify there exists an .. checker and that they can be extended into problems whose verification is easy.