Lower bounds for some decision problems over C
Gregorio Malajovich
Abstract
Lower bounds for some explicit decision problems over the complex numbers are given.
Create a lesson
Related papers
Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems
Kui Du, Jia-Jun Fan
Adaptive data-driven reduced-order models for reciprocal MIMO port-Hamiltonian dynamical systems
Anarzhan Abilgazy, Mikhail Zaslavsky
Fixed-grid schemes for fractional moving-boundary problems
Conrard Giresse Tetsassi Feugmo
Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining
Antonis Polemitis, Nicholas Christakis, Dimitris Drikakis
A probabilistic score estimation using the Bismut--Elworthy--Li formula
Jiatong Sun, Long Nguyen, Ning Jiang et al.
Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems
Jessie Chen, Ziyu Cheng, Yunhui He et al.