Covering polygons is hard

Authors:
J. C. Culberson;R. A. Reckhow
Affiliations:
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada;Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 7

Inapproximability Results for Guarding Polygons without Holes

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A partition-based heuristic for translational box covering

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Optimal parameterized rectangular coverings

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Approximate guarding of monotone and rectilinear polygons

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms for rectangular covering problems

ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...