Write in a clean editor, then format for ACM SIGSAM Bulletin in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM SIGSAM Bulletin is a peer-reviewed journal published by ACM, covering Polynomial and algebraic computation, Numerical Methods and Algorithms, Logic, programming, and type systems.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM SIGSAM Bulletin 12, 3, Article 45 (2023).
Formats any DOI in ACM SIGSAM Bulletin style. No sign-up. |
| Publishes research in | Polynomial and algebraic computation Numerical Methods and Algorithms Logic, programming, and type systems Coding theory and cryptography Computability, Logic, AI Algorithms |
| ISSN | 0163-5824 |
| h-index | 32 |
| i10-index | 131 |
| Total citations | 6,373 |
| Top institutions publishing here | University of California, Berkeley |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Computer algebra is an alternative and complement to numerical mathematics. Its importance is steadily increasing. This volume is the first systematic and complete treatment of computer algebra. It presents the basic problems of computer algebra and the best algorithms now known for their solution with their mathematical foundations, and complete references to the original literature.…
REDLOG is a package that extends the computer algebra system REDUCE to a computer logic system, i.e., a system that provides algorithms for the symbolic manipulation of first-order formulas over some temporarily fixed language and theory. In contrast to theorem provers, the methods applied know about the underlying algebraic theory and make use of it.…
The problem of determining shortest vectors and reduced bases or successive minima of lattices often occurs in algebra and number theory. Nevertheless, computational methods for the solution hardly exist in the literature. It is the aim of this paper to develop efficient algorithms for this purpose.
This report introduces Q EPCAD , B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the Q EPCAD system for quantifier elimination by partial cylindrical algebraic decomposition written by Hoon Hong in the early 1990s. This paper briefly discusses some of the improvements…
We define a certain type of bases of polynomial ideals whose usefulness stems from the fact that a number of computability problems in the theory of polynomial ideals (e.g. the problem of constructing canonical forms for polynomials) is reducible to the construction of bases of this type. We prove a characterization theorem for these bases…
ACM Transactions on the Web
Journal of Data and Information Quality
Proceedings of the ACM on Measurement and Analysis of Computing Systems
ACM Journal of Data Science
ACM Transactions on AI Security and Privacy
ACM Transactions on Computational Logic
ACM Transactions on Design Automation of Electronic Systems
ACM Transactions on Intelligent Systems and Technology
