An isomorphism theorem for circuit complexity

被引:2
|
作者
Agrawal, M [1 ]
Allender, E [1 ]
机构
[1] UNIV ULM, INST INFORMAT, D-89069 ULM, GERMANY
来源
ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS | 1996年
关键词
D O I
10.1109/CCC.1996.507663
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:2 / 11
页数:10
相关论文
共 50 条
  • [21] AN ISOMORPHISM THEOREM ON UNIVERSAL ALGEBRAS
    CHAWLA, LM
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (02): : 397 - &
  • [22] AN ISOMORPHISM THEOREM IN LINEAR ALGEBRA
    MEYBERG, K
    PROCEEDINGS OF THE KONINKLIJKE NEDERLANDSE AKADEMIE VAN WETENSCHAPPEN SERIES A-MATHEMATICAL SCIENCES, 1968, 71 (04): : 448 - &
  • [23] ISOMORPHISM THEOREM FOR KLEINIAN GROUPS
    MARDEN, A
    MASKIT, B
    INVENTIONES MATHEMATICAE, 1979, 51 (01) : 9 - 14
  • [24] ISOMORPHISM THEOREM FOR ABELIAN GROUPS
    CUTLER, DO
    AMERICAN MATHEMATICAL MONTHLY, 1964, 71 (08): : 949 - &
  • [25] Rings with the dual of the isomorphism theorem
    Nicholson, WK
    Campos, ES
    JOURNAL OF ALGEBRA, 2004, 271 (01) : 391 - 406
  • [26] AN ISOMORPHISM THEOREM FOR DRAGILEV SPACES
    KOCATEPE, M
    ARCHIV DER MATHEMATIK, 1988, 50 (03) : 281 - 286
  • [27] AN ISOMORPHISM THEOREM FOR ALEXANDER BIQUANDLES
    Lam, Daisy
    Nelson, Sam
    INTERNATIONAL JOURNAL OF MATHEMATICS, 2009, 20 (01) : 97 - 107
  • [28] On the Complexity of Polytope Isomorphism Problems
    Volker Kaibel
    Alexander Schwartz
    Graphs and Combinatorics, 2003, 19 : 215 - 230
  • [29] The complexity of Boolean constraint isomorphism
    Böhler, E
    Hemaspaandra, E
    Reith, S
    Vollmer, H
    STACS 2004, PROCEEDINGS, 2004, 2996 : 164 - 175
  • [30] The Complexity of Planar Graph Isomorphism
    Toran, Jacobo
    Toran, Jacobo
    Wagner, Fabian
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2009, (97): : 60 - 82