scientific article

zbMath0659.68072MaRDI QIDQ4040887

No author found.

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitycryptographyKolmogorov complexityComplexitypseudorandom number generationInformation theorycommunication complexitycomplexity measurelearnabilitycircuit computationsTuring machines. Computational information theory

Mathematics Subject Classification ID

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

Related Items (4)

A comparison of two lower bound methods for communication complexity ⋮ Gambling, Computational Information and Encryption Security ⋮ The security of machine learning ⋮ On the communication complexity of Lipschitzian optimization for the coordinated model of computation

This page was built for publication: