A fast algorithm for solving a simple search problem

DOI10.1134/S0965542519050105zbMath1423.68459OpenAlexW2949085821WikidataQ127636357 ScholiaQ127636357MaRDI QIDQ2332641

G. Sh. Tamasyan, Vasily N. Malozemov

Publication date: 4 November 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542519050105

zbMATH Keywords

fast algorithmdependence of solution on parametersGibbs lemmasimple search problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• An O(n) algorithm for quadratic knapsack problems
• Synthesis of a rational filter in the presence of complete alternance
• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
• Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function

This page was built for publication: A fast algorithm for solving a simple search problem