Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DCG
2008

favoriteEmaildiscussreport

70views more DCG 2008»

Decomposability of Polytopes

13 years 4 months ago

Decomposability of Polytopes

Download www.ballarat.edu.au

Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We apply it to give new sufficient conditions for indecomposability of polytopes, and then illustrate them with some examples.

Krzysztof Przeslawski, David Yost

Real-time Traffic

Characterization | DCG 2008 | Polytopes | Transparent Proof |

claim paper

Related Content

» Decomposing the Secondary Cayley Polytope

» Polynomial irreducibility testing through Minkowski summand computation

» CrossLayer Congestion Control Routing and Scheduling Design in Ad Hoc Wireless Networks

» Efficient robust optimization for robust control with constraints

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DCG
Authors	Krzysztof Przeslawski, David Yost

Comments (0)