scientific article; zbMATH DE number 4068270
From MaRDI portal
Publication:3801064
zbMATH Open0654.68040MaRDI QIDQ3801064FDOQ3801064
Authors: Stasys Jukna 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Cited In (22)
- Rounds in Communication Complexity Revisited
- Lower bounds for one-way probabilistic communication complexity
- Title not available (Why is that?)
- Space-bounded communication complexity
- Approximation of boolean functions by combinatorial rectangles
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Communication complexity of key agreement on small ranges
- A comparison of two lower-bound methods for communication complexity
- Communication lower bounds using directional derivatives
- Entropy of contact circuits and lower bounds on their complexity
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
- Communication complexity towards lower bounds on circuit depth
- Relations between communication complexity classes
- Some order dimension bounds for communication complexity problems
- Compressed communication complexity of longest common prefixes
- Lower bounds on the multiparty communication complexity
- Non-deterministic communication complexity with few witnesses
- Automata, Languages and Programming
- Title not available (Why is that?)
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 Q3801064)
