New applications of the incompressibility method. II
From MaRDI portal
Publication:1978700
Recommendations
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3934941 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- A fast expected time algorithm for Boolean matrix multiplication and transitive closure
- A note on the number of \(N\)-bit strings with maximum complexity
- Communication Complexity
- Determining the majority
- Kolmogorov complexity arguments in combinatorics
- Mathematics for the Analysis of Algorithms.
- Matrix multiplication via arithmetic progressions
- New Applications of the Incompressibility Method
- On computing majority by comparisons
- The Average-Case Complexity of Determining the Majority
Cited in
(9)- Average-case analysis of quicksort and binary insertion tree height using incompressibility
- scientific article; zbMATH DE number 1408350 (Why is no real title available?)
- New Applications of the Incompressibility Method
- Individual communication complexity
- A characterization of average case communication complexity
- scientific article; zbMATH DE number 1405647 (Why is no real title available?)
- Constraints placed on random sequences by their compressibility
- Kolmogorov complexity and combinatorial methods in communication complexity
- On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma
This page was built for publication: New applications of the incompressibility method. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978700)
