"A Tight Lower Bound for the Complexity of Path-Planning for a Disc."

Colm Ó'Dúnlaing (1988)

Details and statistics

DOI: 10.1016/0020-0190(88)90203-7

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics