2020
DOI: 10.1007/978-3-030-60327-4_7
|View full text |Cite
|
Sign up to set email alerts
|

On the Complexity of Quadratization for Polynomial Differential Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
53
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 12 publications
(53 citation statements)
references
References 8 publications
0
53
0
Order By: Relevance
“…That PIVP of degree 3 can now be used as input of our previous compilation pipeline [11]. It is first transformed in quadratic form [19], in this case by introducing one variable, BT = B.T , and removing the time T , giving the following quadratic PIVP:…”
Section: Examplementioning
confidence: 99%
See 4 more Smart Citations
“…That PIVP of degree 3 can now be used as input of our previous compilation pipeline [11]. It is first transformed in quadratic form [19], in this case by introducing one variable, BT = B.T , and removing the time T , giving the following quadratic PIVP:…”
Section: Examplementioning
confidence: 99%
“…The quadratization algorithm [19] now introduces new variables BX and T BX for the corresponding monomials, and removes variables T and B. This generates the following quadratic PIVP:…”
Section: Examplementioning
confidence: 99%
See 3 more Smart Citations