Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings

DOI10.1016/J.AMC.2013.09.008zbMATH Open1334.68099OpenAlexW1997528026MaRDI QIDQ279055

Bolesław Kacewicz, Maciej Goćwin

Publication date: 27 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.09.008

zbMATH Keywords

complexityoptimalityquantum algorithmsdeterministic algorithmsnonlinear equationsrandomized algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

A complexity approach to the soliton resolution conjecture

This page was built for publication: Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q279055)