scientific article; zbMATH DE number 999544

MaRDI QIDQ3128013zbMATH OpenFDO

Authors El'yar E. Gasanov

Publication date 15 April 1997

zbMATH Keywords

average search probleminstant solvability

Mathematics Subject Classification ID

Search theory (90B40) Discrete-time games (91A50)

Recommendations

• Instantly solvable search problems
• Average complexity of searching for identical objects in random nonuniform databases
• A hard problem that is almost always easy
• scientific article; zbMATH DE number 512870

Cited in

(2)

• Average complexity of searching for identical objects in random nonuniform databases
• Instantly solvable search problems

This page was built for publication:

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