Cover Image

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Basson, Dirk, Boehm, Janko, Marais, Magdaleen S., Rahn, Mirko, Rakotoarisoa, Hobihasina P.
Format:	Preprint
Published:	2024
Subjects:	Algebraic Geometry Commutative Algebra 68W10 (Primary), 68W30, 68Q85, 14Q99 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Algorithms for Finite $\mathbb{Z}$-Algebras
by: Kreuzer, Martin, et al.
Published: (2023)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
by: Gerlach, Raphael, et al.
Published: (2023)

A C implementation of the Smith massager algorithm
by: Wang, Ziwen, et al.
Published: (2026)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Exact block encoding of imaginary time evolution with universal quantum neural networks
by: Rrapaj, Ermal, et al.
Published: (2024)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Computing Certificates of Strictly Positive Polynomials in Archimedean Quadratic Modules
by: Shang, Weifeng, et al.
Published: (2025)

A Geometric Approach to Cylindrical Algebraic Decomposition
by: Chen, Rizeng
Published: (2023)

SubalgebraBases in Macaulay2
by: Burr, Michael, et al.
Published: (2023)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

An Effective Positivstellensatz over the Rational Numbers for Finite Semialgebraic Sets
by: Baldi, Lorenzo, et al.
Published: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings
by: Yakymenko, Danylo, et al.
Published: (2026)

Generating DDPM-based Samples from Tilted Distributions
by: Mandal, Himadri, et al.
Published: (2026)

Improvements of convex-dense factorization of bivariate polynomials
by: Weimann, Martin
Published: (2025)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Fast computation of Riemann-Roch spaces for singular curves
by: Darkaoui, Dounia, et al.
Published: (2026)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
by: van der Meyden, Ron
Published: (2025)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
by: Cicirello, Vincent A.
Published: (2017)

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning
by: Zhang, Weikun K., et al.
Published: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
by: Kratsios, Anastasis, et al.
Published: (2025)

Ensembled Direct Multi-Step forecasting methodology with comparison on macroeconomic and financial data
by: Łapiński, Tomasz M., et al.
Published: (2025)

Monodromy Coordinates
by: Brysiewicz, Taylor
Published: (2024)

Approximating k-Center via Farthest-First on $δ$-Covers
by: Wilson, Jason R.
Published: (2026)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
by: Jiang, Wei, et al.
Published: (2026)