Renormalization and computation I: motivation and background
From MaRDI portal
Publication:2865986
zbMath1277.68077arXiv0904.4921MaRDI QIDQ2865986
Publication date: 12 December 2013
Full work available at URL: https://arxiv.org/abs/0904.4921
Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Non-perturbative graph languages, halting problem and complexity ⋮ From Dyson-Schwinger equations to quantum entanglement ⋮ Entropy algebras and Birkhoff factorization ⋮ Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras.