Advances in computational complexity theory
著者
書誌事項
Advances in computational complexity theory
(DIMACS series in discrete mathematics and theoretical computer science, v. 13)
American Mathematical Society, c1993
大学図書館所蔵 全19件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
This collection of recent papers on computational complexity theory grew out of activities during a special year at DIMACS. With contributions by some of the leading experts in the field, this book is of lasting value in this fast-moving field, providing expositions not found elsewhere. Although aimed primarily at researchers in complexity theory and graduate students in mathematics or computer science, the book is accessible to anyone with an undergraduate education in mathematics or computer science. By touching on some of the major topics in complexity theory, this book sheds light on this burgeoning area of research.
目次
Approximate counting with uniform constant-depth circuits by M. Ajtai On strong separations from $AC^0$ by E. Allender and V. Gore Parallel matching complexity of Ramsey's theorem by J. Beck On algorithms for simple stochastic games by A. Condon Locally random reductions in interactive complexity theory by J. Feigenbaum An application of game-theoretic techniques to cryptography by M. J. Fischer and R. N. Wright Composition of the universal relation by J. Ha stad and A. Wigderson Practical perfect cryptographic security by U. M. Maurer Fair games against an all-powerful adversary by R. Ostrovsky, R. Venkatesan, and M. Yung Factoring integers and computing discrete logarithms via diophantine approximation by C. P. Schnorr A new lower bound theorem for read-only-once branching programs and its applications by J. Simon and M. Szegedy On the E -isomorphism problem by J. Wang.
「Nielsen BookData」 より