Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)
Frédéric Bihan
1
,
Erika Croy
2
,
Weixun Deng
3
,
Kaitlyn Phillipson
4
,
Robert J Rennie
5
,
J. Maurice Rojas
3
2
First Interstate Bank
5
Colorado College
|
Тип публикации: Journal Article
Дата публикации: 2023-09-01
scimago Q4
wos Q4
БС4
SJR: 0.195
CiteScore: 1.1
Impact factor: 0.5
ISSN: 19322232, 19322240
General Medicine
Краткое описание
Fewnomial Theory [Kho91] has established bounds on the number of connected components (a.k.a. pieces ) of a broad class of real analytic sets as a function of a particular kind of input complexity, e.g., the number of distinct exponent vectors among a generating set for the underlying ideal. Here, we pursue the algorithmic side: We show how to efficiently compute the exact isotopy type of certain (possibly singular) real zero sets, instead of just estimating their number of pieces. While we focus on the circuit case, our results form the foundation for an approach to the general case that we will pursue later.
Найдено
Ничего не найдено, попробуйте изменить настройки фильтра.
Найдено
Ничего не найдено, попробуйте изменить настройки фильтра.
Топ-30
Журналы
|
1
|
|
|
Journal of Symbolic Computation
1 публикация, 100%
|
|
|
1
|
Издатели
|
1
|
|
|
Elsevier
1 публикация, 100%
|
|
|
1
|
- Мы не учитываем публикации, у которых нет DOI.
- Статистика публикаций обновляется еженедельно.
Вы ученый?
Создайте профиль, чтобы получать персональные рекомендации коллег, конференций и новых статей.
Метрики
1
Всего цитирований:
1
Цитирований c 2024:
0
Цитировать
ГОСТ |
RIS |
BibTex |
MLA
Цитировать
ГОСТ
Скопировать
Bihan F. et al. Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract) // ACM Communications in Computer Algebra. 2023. Vol. 57. No. 3. pp. 152-155.
ГОСТ со всеми авторами (до 50)
Скопировать
Bihan F., Croy E., Deng W., Phillipson K., Rennie R. J., Rojas J. M. Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract) // ACM Communications in Computer Algebra. 2023. Vol. 57. No. 3. pp. 152-155.
Цитировать
RIS
Скопировать
TY - JOUR
DO - 10.1145/3637529.3637538
UR - https://doi.org/10.1145/3637529.3637538
TI - Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)
T2 - ACM Communications in Computer Algebra
AU - Bihan, Frédéric
AU - Croy, Erika
AU - Deng, Weixun
AU - Phillipson, Kaitlyn
AU - Rennie, Robert J
AU - Rojas, J. Maurice
PY - 2023
DA - 2023/09/01
PB - Association for Computing Machinery (ACM)
SP - 152-155
IS - 3
VL - 57
SN - 1932-2232
SN - 1932-2240
ER -
Цитировать
BibTex (до 50 авторов)
Скопировать
@article{2023_Bihan,
author = {Frédéric Bihan and Erika Croy and Weixun Deng and Kaitlyn Phillipson and Robert J Rennie and J. Maurice Rojas},
title = {Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)},
journal = {ACM Communications in Computer Algebra},
year = {2023},
volume = {57},
publisher = {Association for Computing Machinery (ACM)},
month = {sep},
url = {https://doi.org/10.1145/3637529.3637538},
number = {3},
pages = {152--155},
doi = {10.1145/3637529.3637538}
}
Цитировать
MLA
Скопировать
Bihan, Frédéric, et al. “Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract).” ACM Communications in Computer Algebra, vol. 57, no. 3, Sep. 2023, pp. 152-155. https://doi.org/10.1145/3637529.3637538.