Pseudorandom generators against advised context-free languages
type: Item
instance of: scholarly article
title: Pseudorandom generators against advised context-free languages
zbMATH Open document ID: 1333.68175
author: Tomoyuki Yamakami
published in: Theoretical Computer Science
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6524277
zbMATH Keywords: context-free language
zbMATH Keywords: advice
zbMATH Keywords: pseudorandom generator
zbMATH Keywords: pushdown automaton
zbMATH Keywords: pseudorandom language
zbMATH Keywords: swapping property
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.10.026
OpenAlex ID: W2962893111
cites work: Computational Complexity
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Quantitative Relativizations of Complexity Classes
cites work: Foundations of Cryptography
cites work: Q4506483
cites work: Hardness vs randomness
cites work: A taxonomy of complexity classes of functions
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
cites work: Immunity and pseudorandomness of context-free languages
cites work: One-way reversible and quantum finite automata with advice
cites work: Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
DOI: 10.1016/J.TCS.2015.10.026
description: scientific article; zbMATH DE number 6524277