Dipòsit Digital de Documents de la UABmetadata only
An exact duality theory for semidefinite programming and its complexity implications
semidefinite programming, strong duality, complexity classes, theorems of the alternative
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 445455
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.