Amanote Research
Register
Sign In
Some Order Dimension Bounds for Communication Complexity Problems
Acta Informatica
- Germany
doi 10.1007/bf01463947
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Networks
Software
Information Systems
Communications
Date
June 1, 1991
Authors
U. Faigle
W. Kern
Publisher
Springer Science and Business Media LLC
Related search
Upper Bounds on the Complexity of Some Galois Theory Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Property Testing Lower Bounds via Communication Complexity
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Some Lower Bounds for the Complexity of Continuation Methods
Journal of Complexity
Control
Numerical Analysis
Statistics
Probability
Algebra
Applied Mathematics
Number Theory
Optimization
Mathematics
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems
On the Asymptotic Optimality of Error Bounds for Some Linear Complementarity Problems
Numerical Algorithms
Applied Mathematics
Decay Bounds for Solutions of Second Order Parabolic Problems and Their Derivatives II
Mathematical Inequalities and Applications
Mathematics
Applied Mathematics
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science