Polyhedral computation /
"Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general-purpose algorithms. They are, however, highly structured, and attention has turned to exploiting this structure, particularly symmetry. Initial app...
| Corporate Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Book |
| Language: | English |
| Published: |
Providence, R.I. :
American Mathematical Society,
2009
Providence, R.I. : c2009 Providence, R.I. : [2009] |
| Series: | CRM proceedings & lecture notes ;
v. 48 CRM proceedings & lecture notes ; v. 48 |
| Subjects: |
Internet
Stanford University
| Call Number: |
ISIL:US-CST QA491 .P645 2009 |
|---|
Yale University
| Call Number: |
Conf Montreal 2006c |
|---|
University of Chicago
| Call Number: |
QA491 .P645 2009 |
|---|
Johns Hopkins University
| Call Number: |
QA491.P645 2009 |
|---|
Harvard University
| Call Number: |
QA491 .P645 2009 |
|---|
Duke University
| Call Number: |
QA1 .C767 v.48 |
|---|
Cornell University
| Call Number: |
QA491 .P645 2009 |
|---|
Princeton University
| Call Number: |
QA491 .P645 2009 |
|---|
Columbia University
| Call Number: |
QA491 .P645 2009 |
|---|
University of Pennsylvania
| Call Number: |
QA491 .P645 2009 |
|---|