![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ACM Communications in Computer Algebra, Volume 57
Volume 57, Number 1, March 2023
- Sergei A. Abramov, Gleb Pogudin:
Linear Difference Operators with Sequence Coefficients Having Infinite-Dimentional Solution Spaces. 1-4 - Shalosh B. Ekhad, Doron Zeilberger:
Counting Clean Words According to the Number of Their Clean Neighbors. 5-9 - Eva U. Petkovsek:
Marko Petkovšek 1955-2023. 10-18
Volume 57, Number 2, June 2023
- Kazuki Okuda, Kiyoshi Shirayanagi:
Using the Interval-Symbol Method with Zero Rewriting to Factor Polynomials over Algebraic Number Fields. 21-30 - Johannes Blümlein, Nikolai Fadeev, Carsten Schneider:
Computing Mellin Representations and Asymptotics of Nested Binomial Sums in a Symbolic Way: The RICA Package. 31-34 - Jérémy Berthomieu, Stef Graillat, Dimitri Lesnoff, Théo Mary:
Modular Matrix Multiplication on GPU for Polynomial System Solving. 35-38 - Yang-Hui He, Vishnu Jejjala, Brent D. Nelson, Hal Schenck, Michael Eugene Stillman:
MSSM: A Macaulay2 Package for the Vacuum Moduli Space. 39-42 - Christopher W. Brown, Zoltán Kovács, Tomás Recio:
Faithful Real-Time Animation of Parametrized (Semi-) Algebraic Expressions via Cylindrical Algebraic Decomposition. 43-46 - Miguel Ángel Marco Buzunáriz, Ana Romero
, Jose Divasón
:
Effective Homology of Universal Covers. 47-50 - Bertrand Teguia Tabuguia:
Operations for D-Algebraic Functions. 51-56 - Nusa Zidaric
, Guang Gong, Mark D. Aagaard, Aleksandar Jurisic, Olexandr Konovalov
:
FFCSA - Finite Field Constructions, Search, and Algorithms. 57-64 - David Ayotte, Xavier Caruso, Antoine Leudière, Joseph Musleh:
Drinfeld Modules in SageMath. 65-71 - Sergei A. Abramov, Alexander B. Batkhin, Anna A. Ryabenko, Leonid A. Sevastianov, Yvette Zonn, Min Wu:
The Fifth Conference "Computer Algebra" in Moscow. 72-84
Volume 57, Number 3, September 2023
- Ross C. McPhedran, Tony C. Scott
, Aude Maignan:
The Keiper-Li Criterion for the Riemann Hypothesis and Generalized Lambert Functions. 85-110 - Antonio Jiménez-Pastor
, Sonia L. Rueda, Maria-Angeles Zurro:
Computing Almost-Commuting Basis of Ordinary Differential Operators. 111-118 - Hiroshi Sekigawa:
An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance. 119-125 - Tereso del Río
, AmirHosein Sadeghimanesh, Matthew England:
Clustering in the Lazard method for Cylindrical Algebraic Decomposition. 126-132 - Benjamin Chen, Yu Li, Eugene Zima:
On a Two-Layer Modular Arithmetic. 133-136 - Tobias Metzlaff:
Symmetry Adapted Bases for Trigonometric Optimization. 137-140 - Nusa Zidaric:
How to use a CAS for Hardware Design Automation. 141-147 - Snehal Bhayani, Praneeth Susarla, S. S. Krishna Chaitanya Bulusu, Olli Silvén, Markku J. Juntti, Janne Heikkilä:
A Novel Application of Polynomial Solvers in mmWave Analog Radio Beamforming. 148-151 - Frédéric Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, J. Maurice Rojas:
Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract). 152-155 - Katarína Studenicová:
Arithmetics in Generalised Cantor Base Systems. 156-159 - Kosaku Nagasaka, Ryo Oshimatani:
Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters. 160-164
Volume 57, Number 4, December 2023
- M. Levent Dogan, Alperen Ali Ergür, Elias P. Tsigaridas:
On the Complexity of Chow and Hurwitz Forms. 167-199 - Elena Berardini, Alain Couvreur, Grégoire Lecerf:
A Proof of the Brill-Noether Method from Scratch. 200-229
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.