ON ONE-WAY FUNCTIONS AND POLYNOMIAL-TIME ISOMORPHISMS

被引：17
|
作者：
KO, KI
LONG, TJ
DU, DZ
机构：
[1] OHIO STATE UNIV,DEPT COMP & INFORMAT SCI,COLUMBUS,OH 43210
[2] NEW MEXICO STATE UNIV,LAS CRUCES,NM 88003
[3] MATH SCI RES INST,BERKELEY,CA 94720
来源：
THEORETICAL COMPUTER SCIENCE | 1986年 / 47卷 / 03期
关键词：
D O I：
10.1016/0304-3975(86)90152-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：263 / 276
页数：14
相关论文
共 50 条
  • [1] Polynomial-time algorithms for the equivalence for one-way quantum finite automata
    Koshiba, T
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 268 - 278
  • [2] SOME REMARKS ON POLYNOMIAL-TIME ISOMORPHISMS
    WANG, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 468 : 144 - 153
  • [3] Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
    Duris, P
    Hromkovic, J
    Rolim, JDP
    Schnitger, G
    [J]. STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 117 - 128
  • [4] One-Time Trapdoor One-Way Functions
    Cathalo, Julien
    Petit, Christophe
    [J]. INFORMATION SECURITY, 2011, 6531 : 283 - +
  • [5] ON ONE-WAY FUNCTIONS
    WATANABE, O
    [J]. COMBINATORICS, COMPUTING AND COMPLEXITY, 1989, : 98 - 131
  • [6] One-way functions
    Levin, L.A.
    [J]. Problemy Peredachi Informatsii, 2003, 39 (01): : 103 - 117
  • [7] On time computability of functions in one-way cellular automata
    Buchholz, T
    Kutrib, M
    [J]. ACTA INFORMATICA, 1998, 35 (04) : 329 - 352
  • [8] On time computability of functions in one-way cellular automata
    Thomas Buchholz
    Martin Kutrib
    [J]. Acta Informatica, 1998, 35 : 329 - 252
  • [9] POLYGRAPHIC PROGRAMS AND POLYNOMIAL-TIME FUNCTIONS
    Bonfante, Guillaume
    Guiraud, Yves
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2009, 5 (02)
  • [10] Identifying polynomial-time recursive functions
    Schürmann, C
    Shah, J
    [J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 525 - 540
12345