Pseudorandom generators against advised context-free languages (Q899305): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Quantitative Relativizations of Complexity Classes
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4506483
@@ Property / cites work: Q4506483 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of complexity classes of functions
@@ Property / cites work: A taxonomy of complexity classes of functions / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2004: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Immunity and pseudorandomness of context-free languages
+Normal rank
@@ Property / cites work @@
+One-way reversible and quantum finite automata with advice
+Normal rank
@@ Property / cites work @@
+Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
+Normal rank