1017 search results - page 10 / 204 » Some existence and construction results of polygonal designs |
TACAS
2005
Springer
14 years 25 days ago
2005
Springer
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
COMBINATORICS
2006
13 years 7 months ago
2006
The group PGL(2, q), q = pn, p an odd prime, is 3-transitive on the projective line and therefore it can be used to construct 3-designs. In this paper, we determine the sizes of o...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
ICRA
1994
IEEE
13 years 11 months ago
1994
IEEE
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...