scientific article; zbMATH DE number 512807
From MaRDI portal
Publication:4281500
zbMath0789.68054MaRDI QIDQ4281500
Stephan Waack, Christoph Meinel
Publication date: 29 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityupper boundslower boundsbranching programssemiring homomorphismsgraph- accessibility-problems
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Lower bounds for the modular communication complexity of various graph accessibility problems ⋮ Lower bounds for the majority communication complexity of various graph accessibility problems
This page was built for publication: