Sublinear circuits and the constrained signomial nonnegativity problem (Q2687052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7658256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear circuits and the constrained signomial nonnegativity problem |
scientific article; zbMATH DE number 7658256 |
Statements
Sublinear circuits and the constrained signomial nonnegativity problem (English)
0 references
1 March 2023
0 references
sums of arithmetic-geometric exponentials
0 references
positive signomials
0 references
exponential sums
0 references
sums of nonnegative circuit polynomials (SONC)
0 references
positive polynomials
0 references
multiplicative convexity
0 references
log convex sets
0 references
0 references
0 references
0.798962414264679
0 references
0.7860336899757385
0 references
0.7852087616920471
0 references
0.7779877781867981
0 references
0.7709470987319946
0 references
