Reachability analysis of polynomial systems using linear programming relaxations (Q4649293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reachability analysis of polynomial systems using linear programming relaxations |
scientific article; zbMATH DE number 6109365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability analysis of polynomial systems using linear programming relaxations |
scientific article; zbMATH DE number 6109365 |
Statements
Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations (English)
0 references
21 November 2012
0 references
0.8452767133712769
0 references
0.8119633197784424
0 references
0.8030805587768555
0 references
0.800818145275116
0 references
0.789658784866333
0 references
