scientific article

zbMath0647.68061MaRDI QIDQ3792250

Ivan Kramosil

Publication date: 1988

Full work available at URL: https://eudml.org/doc/28283

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

extremum-searchhierarchical parallel probabilistic algorithmstime computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On Synchronous Parallel Computations with Independent Probabilistic Choice
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees

This page was built for publication: