A fast algorithm for solving a simple search problem

DOI10.1134/S0965542519050105MaRDI QIDQ2332641zbMATH OpenOpenAlexWikidataFDO

Authors G. Sh. Tamasyan, V. 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

dependence of solution on parametersfast algorithmGibbs lemmasimple search problem

Mathematics Subject Classification ID

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

Cites work

• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
• An O(n) algorithm for quadratic knapsack problems
• Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
• scientific article; zbMATH DE number 3247810 (Why is no real title available?)
• Synthesis of a rational filter in the presence of complete alternance

Cited in

(3)

• A Simplified IDEA Algorithm
• scientific article; zbMATH DE number 5540281 (Why is no real title available?)
• Quest for fast partial search algorithm

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

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