scientific article; zbMATH DE number 4197419
From MaRDI portal
Publication:5203681
zbMath0725.68046MaRDI QIDQ5203681
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
The rectangle covering number of random Boolean matrices, The corruption bound, log-rank, and communication complexity, On relations between counting communication complexity classes, Non-deterministic communication complexity with few witnesses, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, A comparison of two lower-bound methods for communication complexity, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Fourier analysis for probabilistic communication complexity, A comparison of two lower bound methods for communication complexity, Around the log-rank conjecture, Generalized substring selectivity estimation, Clique versus independent set, Approximate nonnegative rank is equivalent to the smooth rectangle bound, On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes, Some order dimension bounds for communication complexity problems, Lower bounds for one-way probabilistic communication complexity, Private vs. common random bits in communication complexity, Harmonic analysis, real approximation, and the communication complexity of Boolean functions, Communication complexity of two decision problems, Information-theoretic approximations of the nonnegative rank, Multipartite quantum correlation and communication complexities, On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's, Matrices generated by semilattices, Network mechanisms, informational efficiency, and hierarchies, New lower bounds for Hopcroft's problem, A three-party communication problem, The Communication Complexity of Set Intersection and Multiple Equality Testing, Communication Complexity of Pairs of Graph Families with Applications, Communication complexity method for measuring nondeterminism in finite automata, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC, Communication complexity in lattices
