A POLYNOMIAL-TIME GENERATOR FOR MINIMAL PERFECT HASH FUNCTIONS

被引:0
|
作者
KEGLER, J
机构
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:556 / 557
页数:2
相关论文
共 50 条
  • [41] Polynomial-time normalizers
    Luks, Eugene M.
    Miyazaki, Takunari
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (04): : 61 - 96
  • [42] POLYNOMIAL-TIME HIERARCHIES ON SOME CLASSES OF FUNCTIONS-(I)
    ZHANG, LA
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 1994, 37 (08): : 1018 - 1024
  • [43] A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
    A. Blum
    A. Frieze
    R. Kannan
    S. Vempala
    [J]. Algorithmica, 1998, 22 : 35 - 52
  • [44] PROBABILISTIC POLYNOMIALS, AC(0) FUNCTIONS AND THE POLYNOMIAL-TIME HIERARCHY
    TARUI, J
    [J]. THEORETICAL COMPUTER SCIENCE, 1993, 113 (01) : 167 - 183
  • [45] A polynomial-time algorithm for learning noisy linear threshold functions
    Blum, A
    Frieze, A
    Kannan, R
    Vempala, S
    [J]. ALGORITHMICA, 1998, 22 (1-2) : 35 - 52
  • [46] Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash
    Pibiri, Giulio Ermanno
    Trani, Roberto
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (03) : 1249 - 1259
  • [47] ORDER-PRESERVING MINIMAL PERFECT HASH FUNCTIONS AND INFORMATION-RETRIEVAL
    FOX, EA
    QI, FC
    DAOUD, AM
    HEATH, LS
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1991, 9 (03) : 281 - 308
  • [48] POLYNOMIAL-TIME HIERARCHIES ON SOME CLASSES OF FUNCTIONS .2.
    ZHANG, L
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 1994, 37 (09): : 1135 - 1143
  • [49] A polynomial-time algorithm for learning noisy linear threshold functions
    Blum, A
    Frieze, A
    Kannan, R
    Vempala, S
    [J]. 37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 330 - 338
  • [50] POLYNOMIAL-TIME FUNCTIONS GENERATE SAT - ON P-SPLINTERS
    HEMACHANDRA, LA
    HOENE, A
    SIEFKES, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 379 : 259 - 269