Skip to main content
Theoretical Computer Science

Return to Answer

replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
Source Link
Community Bot
Community Bot
  • 1

domotorp proves a tighter relation between deterministic communication complexity and protocol partition numberrelation between deterministic communication complexity and protocol partition number, thus answering a question by Hermann Gruber (which had been unanswered for more than 10 months).

domotorp proves a tighter relation between deterministic communication complexity and protocol partition number, thus answering a question by Hermann Gruber (which had been unanswered for more than 10 months).

domotorp proves a tighter relation between deterministic communication complexity and protocol partition number, thus answering a question by Hermann Gruber (which had been unanswered for more than 10 months).

Source Link
Hermann Gruber
Hermann Gruber
  • 6.8k
  • 15
  • 3

domotorp proves a tighter relation between deterministic communication complexity and protocol partition number, thus answering a question by Hermann Gruber (which had been unanswered for more than 10 months).