𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pseudorandom Generators in Propositional Proof Complexity

✍ Scribed by Alekhnovich, Michael; Ben-Sasson, Eli; Razborov, Alexander A.; Wigderson, Avi

Book ID
118181129
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
283 KB
Volume
34
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Proof complexity of propositional defaul
Proof complexity of propositional default logic
✍ Olaf Beyersdorff; Arne Meier; Sebastian MΓΌller; Michael Thomas; Heribert Vollmer πŸ“‚ Article πŸ“… 2011 πŸ› Springer 🌐 English βš– 551 KB
Intensive statistical complexity measure
Intensive statistical complexity measure of pseudorandom number generators
✍ H.A. Larrondo; C.M. GonzΓ‘lez; M.T. MartΓ­n; A. Plastino; O.A. Rosso πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 245 KB

A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity (Phy