scientific article; zbMATH DE number 4066342

zbMATH Open0653.68048MaRDI QIDQ3799641FDOQ3799641

Authors: Srinivasan Sekar, Sanjeev B. Ahuja 

Publication date: 1987

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

Recommendations

• Erratum to: Kolmogorov complexity arguments in combinatorics
• Correction to ``Computational complexity of algebraic functions
• The truth about algorithmic problems in correspondence theory
• Corrigendum to: ``Complexity and approximability of the happy set problem
• Corrigendum: The complexity of counting graph homomorphisms
• Counterexamples revisited: principles, algorithms, applications

zbMATH Keywords

parallel algorithmheuristic searchparallelismparallel processing languagesreducing the average time behaviour of search algorithms

Mathematics Subject Classification ID

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

Cited In (1)

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