Order in pseudorandomness

被引：0
|
作者：
Vadhan, SP [1 ]
机构：
[1] Harvard Univ, Div Engn & Appl Sci, Cambridge, MA 02138 USA
来源：
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES | 2001年 / 2129卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：10 / 11
页数：2
相关论文
共 50 条
  • [41] Pseudorandomness for read-once formulas
    Bogdanov, Andrej
    Papakonstantinou, Periklis A.
    Wan, Andrew
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 240 - 246
  • [42] On new measures of pseudorandomness of binary lattices
    Katalin Gyarmati
    Acta Mathematica Hungarica, 2011, 131 : 346 - 359
  • [43] On Separation Logic, Computational Independence, and Pseudorandomness
    Dal Lago, Ugo
    Davoli, Davide
    Kapron, Bruce M.
    2024 IEEE 37TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM, CSF 2024, 2024, : 80 - 95
  • [44] Pseudorandomness of Camellia-like scheme
    Wu, WL
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (01) : 82 - 88
  • [45] On new measures of pseudorandomness of binary lattices
    Gyarmati, K.
    ACTA MATHEMATICA HUNGARICA, 2011, 131 (04) : 346 - 359
  • [46] Pseudorandomness of the Schrödinger Map Equation
    Kumar, Sandeep
    ACTA APPLICANDAE MATHEMATICAE, 2024, 193 (01)
  • [47] The Coin Problem, and Pseudorandomness for Branching Programs
    Brody, Joshua
    Verbin, Elad
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 30 - 39
  • [48] On pseudorandomness and resource-bounded measure
    Arvind, V
    Köbler, J
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 205 - 221
  • [49] Pseudorandomness for permutation and regular branching programs
    De, Anindya
    2011 IEEE 26TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2011, : 221 - 231
  • [50] Pseudorandomness on the round-structure of Skipjack
    Wu, Wenling
    Wei, Hongru
    Chin J Electron, 1600, 3
12345