Pages that link to "Item:Q1900891"
From MaRDI portal
The following pages link to The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891):
Displayed 11 items.
- Orienting polygonal parts without sensors (Q686743) (← links)
- Computing fence designs for orienting parts (Q1265285) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Bounding the locus of the center of mass for a part with shape variation (Q2248739) (← links)
- Reprint of: Bounding the locus of the center of mass for a part with shape variation (Q2341693) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- (Q5005150) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Orienting polyhedral parts by pushing (Q5959552) (← links)