scientific article; zbMATH DE number 1008511
From MaRDI portal
Publication:4336271
zbMATH Open0867.68061MaRDI QIDQ4336271FDOQ4336271
Authors: Paul M. B. Vitányi, Ming Li 
Publication date: 12 May 1997
Title of this publication is not available (Why is that?)
Recommendations
- Average-case analysis of algorithms using Kolmogorov complexity
- Average-Case Complexity
- scientific article
- On the theory of average case complexity
- scientific article; zbMATH DE number 1072538
- Average case complexity, revisited
- scientific article; zbMATH DE number 986985
- scientific article; zbMATH DE number 512870
- scientific article; zbMATH DE number 4041254
- Approximating Kolmogorov complexity
Cited In (12)
- Average-Case Completeness in Tag Systems
- On the average complexity of the $k$-level
- Maximum likelihood analysis of heapsort
- Average case complexity under the universal distribution equals worst- case complexity
- Title not available (Why is that?)
- Maximum likelihood analysis of algorithms and data structures
- How robust are average complexity measures? A statistical case study
- Average-case analysis of algorithms using Kolmogorov complexity
- Average Case Analysis of Marking Algorithms
- Average-case analysis via incompressibility
- Title not available (Why is that?)
- Average-Case Complexity
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 Q4336271)
