scientific article

zbMATH Open0653.68048MaRDI QIDQ3799641

Sanjeev B. Ahuja, Srinivasan Sekar

Publication date: 1987

Title of this publication is not available (Why is that?)

zbMATH Keywords

parallelismparallel algorithmheuristic searchparallel processing languagesreducing the average time behaviour of search algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (1)

Corrigendum to: ``Complexity and approximability of the happy set problem

Recommendations

• Title not available (Why is that?) 👍 👎
• Correction to ``Computational complexity of algebraic functions 👍 👎
• Erratum to: Kolmogorov complexity arguments in combinatorics 👍 👎
• Corrigendum: The complexity of counting graph homomorphisms 👍 👎
• Verification: Theory and Practice 👍 👎
• Corrigendum to: ``Complexity and approximability of the happy set problem 👍 👎

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 Q3799641)