On multi-partition communication complexity

Thumbnail
Metadata only
Author
Ďuriš, Pavol
Hromkovič, Juraj
Jukna, Stasys
Sauerhoff, Martin
Schnitger, Georg
Show all
Date
2004-10
Type
    Journal Article
Publication status
published
External links
Search via SFX
Journal / series
Information and Computation
Volume
194(1)
Pages / Article No.
49 - 75
Publisher
Elsevier
Subject
Computational complexity; Multi-partition communication complexity; Non-obliviousness; Lower bounds; Complexity hierarchy; Read-once branching programs
Organisational unit
03666 - Hromkovic, Juraj / Hromkovic, Juraj  
Notes
Received 2 January 2004, Revised 5 May 2004, Published online 3 August 2004.
More
Show all metadata
Citations
Cited 4 times in Web of Science
ETH Bibliography
yes
Altmetrics