Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants

Pierre Roux, Yuen-Lam Voronin, Sriram Sankaranarayanan

Open source

DOI
10.1007/978-3-662-53413-7_21
Published
2016
Container
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-662-53413-7_21,
  title = {Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants},
  author = {Pierre Roux and Yuen-Lam Voronin and Sriram Sankaranarayanan},
  year = {2016},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-662-53413-7_21},
  url = {https://doi.org/10.1007/978-3-662-53413-7_21}
}

RIS

TY  - JOUR
TI  - Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants
AU  - Pierre Roux
AU  - Yuen-Lam Voronin
AU  - Sriram Sankaranarayanan
PY  - 2016
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-662-53413-7_21
UR  - https://doi.org/10.1007/978-3-662-53413-7_21
ER  - 

APA

Roux, P., Voronin, Y., & Sankaranarayanan, S. (2016). Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-53413-7_21

Source records