scientific article; zbMATH DE number 194098
circuit computationscommunication complexityComplexitycomplexity measurecomputational complexitycryptographyInformation theoryKolmogorov complexitylearnabilitypseudorandom number generationTuring machines. Computational information theory
Conference proceedings and collections of articles (00Bxx) Complexity of computation (including implicit computational complexity) (03D15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Information theory (general) (94A15) Measures of information, entropy (94A17) Cryptography (94A60)
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation
- The security of machine learning
- Gambling, computational information and encryption security
- Structural and Quantitative Characteristics of Complexity in Terms of Information
- Interactive Information Complexity
- On the Combinatorial Representation of Information
- The complexity of information extraction
- scientific article; zbMATH DE number 4022600 (Why is no real title available?)
- scientific article; zbMATH DE number 66621 (Why is no real title available?)
- scientific article; zbMATH DE number 3605746 (Why is no real title available?)
- A comparison of two lower bound methods for communication complexity (extended abstract)
- scientific article; zbMATH DE number 5583062 (Why is no real title available?)
- Information Efficiency
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)