The problem of deciding whether 2-or 3-dimensional objects can be separated by a sequence of arbitrary translational motions is known to have exponential lower bounds. However, under certain restrictions on the type of motions, polynomial time bounds have been shown. An example is finding a subset o
โฆ LIBER โฆ
On the complexity of polyhedral separability
โ Scribed by Nimrod Megiddo
- Publisher
- Springer
- Year
- 1988
- Tongue
- English
- Weight
- 745 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the complexity of one-shot translatio
โ
Fabian Schwarzer; Achim Schweikard
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 261 KB
On the complexity of four polyhedral set
โ
Robert M. Freund; James B. Orlin
๐
Article
๐
1985
๐
Springer-Verlag
๐
English
โ 309 KB
Analytic and polyhedral approximation of
โ
Robert Deville; Vladimir Fonf; Petr Hรกjek
๐
Article
๐
1998
๐
The Hebrew University Magnes Press
๐
English
โ 704 KB
Separability and separability flexibilit
โ
John R. Conlon
๐
Article
๐
1993
๐
Springer
๐
English
โ 319 KB
On the separability of catalytic deactiv
โ
John B. Butt; Carol K. Wachter; Rustom M. Billimoria
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 685 KB
An analysis of deactlvat!on hnetlcs for a number of model surfaces reveals that formulatton in terms of a separable actkvlty factor IS correct only for an &al surface Further there 1s no apparent general correlation between the separable analysis and the correct treatment lNTRonucTKoN In theu early
On the separability of electronic wave f
โ
William H. Adams
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 370 KB