The complexity of oblivious plans for orienting and distinguishing polygonal parts
From MaRDI portal
Publication:1900891
DOI10.1007/BF01192046zbMath0830.68062MaRDI QIDQ1900891
Publication date: 25 October 1995
Published in: Algorithmica (Search for Journal in Brave)
Related Items (11)
Computational complexity of synchronization under sparse regular constraints ⋮ Unnamed Item ⋮ Synchronizing Automata and the Černý Conjecture ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Bounding the locus of the center of mass for a part with shape variation ⋮ Orienting polygonal parts without sensors ⋮ Orienting polyhedral parts by pushing ⋮ Computing fence designs for orienting parts ⋮ Černý's conjecture and the road colouring problem ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices ⋮ Reprint of: Bounding the locus of the center of mass for a part with shape variation
Cites Work
This page was built for publication: The complexity of oblivious plans for orienting and distinguishing polygonal parts
