Extracting Computational Entropy and Learning Noisy Linear Functions

DOI10.1007/978-3-642-02882-3_34MaRDI QIDQ5323082zbMATH OpenOpenAlexFDO

Authors Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai

Publication date 23 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_34

Mathematics Subject Classification ID

Computational learning theory (68Q32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Computational extractors and pseudorandomness
• Extracting randomness from extractor-dependent sources
• Computational analogues of entropy
• Deterministic Extractors for Independent-Symbol Sources
• Extractors for circuit sources

Cites work

• A Pseudorandom Generator from any One-way Function
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Deterministic Extractors for Independent-Symbol Sources
• Deterministic extractors for small-space sources
• Extracting Randomness from Multiple Independent Sources
• Extracting Randomness Using Few Independent Sources
• Extractor Codes
• Extractors
• Extractors and pseudorandom generators
• Extractors for a constant number of polynomially small MIN-entropy independent sources
• Extractors with weak random seeds
• scientific article; zbMATH DE number 1820017 (Why is no real title available?)
• scientific article; zbMATH DE number 5485576 (Why is no real title available?)
• Learning polynomials with queries: The highly noisy case
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Noise-tolerant learning, the parity problem, and the statistical query model
• Randomness is linear in space
• Simulating independence
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Cited in

(1)

• Computational Randomness from Generalized Hardcore Sets

This page was built for publication: Extracting Computational Entropy and Learning Noisy Linear Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323082)