<電子ブック>
Annual IEEE Conference on Computational Complexity : San Diego, CA - 2007

本文言語
出版者
出版年
出版地
概要 Papers from a June 2007 conference shed light on recent work in areas such as halfspace matrices, time-space tradeoffs for counting NP Solutions modulo integers, unbalanced expanders and randomness ex...tractions from Parvesh-Vardy codes, and quantum versus classical proofs and advice. Other topics examined include approximate majority and probabilistic time, the complexity of polynomials and their coefficient functions, a linear round lower bound for Lovasz- Schrijver SDP relaxations of vertex cover, and directed planar reachability in unambiguous log-space. Heuristic time hierarchies, mathgate computations, a new interactive hashing theorem, and parity problems in planar graphs are some other subjects explored.続きを見る
本文を見る Full text available from IEEE Proceedings Order Plans (POP) 1998-present [Journals partially Not access(雑誌は一部のみ閲覧可能)]

詳細

レコードID
SSID
eISBN
登録日 2020.06.27
更新日 2021.05.09