scientific article

zbMATH Open0659.68072MaRDI QIDQ4040887FDOQ4040887

Author name not available (Why is that?)

Publication date: 5 June 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexitycryptographycommunication complexityKolmogorov complexitypseudorandom number generationComplexityInformation theorycomplexity measurelearnabilitycircuit computationsTuring machines. Computational information theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Measures of information, entropy (94A17) Cryptography (94A60) Artificial intelligence (68T99) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity of computation (including implicit computational complexity) (03D15) Conference proceedings and collections of articles (00Bxx)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Interactive Information Complexity
• Gambling, Computational Information and Encryption Security
• Structural and Quantitative Characteristics of Complexity in Terms of Information
• A comparison of two lower bound methods for communication complexity
• The security of machine learning
• On the communication complexity of Lipschitzian optimization for the coordinated model of computation

   Recommendations

• Communication Complexity 👍 👎
• Measures of uncertainty and information in computation 👍 👎
• Title not available (Why is that?) 👍 👎
• Average and randomized communication complexity 👍 👎
• 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 Q4040887)