paper
Computational Complexity of Polynomial Subalgebras
Leonie Kayser
computational financearxiv
Description
The computational complexity of polynomial ideals and Gröbner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational algebra, with a view towards effective algorithms. We investigate the computational complexity of the subalgebra membership problem and degree bounds. In particular, we show completeness for the complexity class EXPSPACE and prove PSPACE-completeness for homogeneous...
Similar Books
paper
Quantitative mode stability for the wave equation on the Kerr-Newman spacetime
Damon Civin
Quantitative mode stability for the wave equation on the Kerr-Newman spacetime
paper
Risk-Aware Objective-Based Forecasting in Inertia Management
Haipeng Zhang, Ran Li, Yan Chen, Zhongda Chu, Mingyang Sun
Risk-Aware Objective-Based Forecasting in Inertia Management
paper
Chainalysis: Geography of Cryptocurrency 2023
Chainalysis
Chainalysis: Geography of Cryptocurrency 2023
paper
Periodicity in Cryptocurrency Volatility and Liquidity
Peter Reinhard Hansen, Chan Kim, Wade Kimbrough
Periodicity in Cryptocurrency Volatility and Liquidity
paper
Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain
Saeideh Sekhavat, Mostafa Jamshidian, Adam Wittek, Karol Miller
Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain
paper
Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I
Getachew K. Befekadu
Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I