scientific article; zbMATH DE number 2080190

MaRDI QIDQ4472432zbMATH OpenFDO

Authors Bernard Chazelle

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740046.htm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of computing (68Q01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Irregularities of distributions and extremal sets in combinatorial complexity theory
• scientific article; zbMATH DE number 3924808
• Randomisation and derandomisation in descriptive complexity theory
• Randomisation and derandomisation in descriptive complexity theory
• Some results on derandomization
• scientific article; zbMATH DE number 1962815
• scientific article; zbMATH DE number 740346
• Randomness, computability, and density
• scientific article; zbMATH DE number 1688364
• Entropy, Randomization, Derandomization, and Discrepancy

Cited in

(4)

• scientific article; zbMATH DE number 1354122 (Why is no real title available?)
• scientific article; zbMATH DE number 1962815 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• Entropy, Randomization, Derandomization, and Discrepancy

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 Q4472432)