A note on computational indistinguishability
From MaRDI portal
Publication:910218
DOI10.1016/0020-0190(90)90010-UzbMath0695.68037MaRDI QIDQ910218
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
03D05: Automata and formal grammars in connection with logical questions
Related Items
Cites Work