Complexity theory : current research

>> Google Books

所蔵情報QRコード

Complexity theory : current research / edited by Klaus Ambos-Spies, Steven Homer, Uwe Schöning

資料種別:

図書

出版情報:

Trumpington Street, Cambridge : Press Syndicate of the University of Cambridge, 1993

形態:

viii, 313 p. ; 24 cm

著者名:

ISBN:

9780521442206 [0521442206]

書誌ID:

BA21528773

子書誌情報

フルテキスト

所蔵情報

他の版・巻

書誌詳細

注記:

Includes bibliographical references

主題:

Computational complexity

言語:

英語

目次情報:

Reductions to sets of low information content / V. Arvind ; Y. Han ; L. Hemachandra ; J. Kobler ; A. Lozano ; M. Mundhenk ; M. Ogiwara ; U. Schoening ; R. Silvestri ; T. Thierauf1：

On average P vs. average NP / J. Belanger ; J. Wang2：

Upper and lower bounds for certain graph accessibility problems on bounded alternating omega-branching programs / C. Meinel ; S. Waack3：

Bounded reductions / H. Buhrman ; E. Spaan ; L. Torenvliet4：

On the non-uniform complexity of the graph isomorphism problem / J. Toran5：

The complexity of space bounded interactive proof systems / A. Condon6：

Degrees of unsolvability in abstract complexity theory / M. Kummer7：

Fixed parameter tractability and completeness / R. Downey ; M. Fellows8：

Associative storage modification machines / J. Tromp ; P. van Emde Boas9：

Additional queries and algorithmically random languages / R. Book10：

Promise problems and guarded access to unambiguous computation / J.-Y. Cai ; J. Vyskoc11：

Reductions to sets of low information content / V. Arvind ; Y. Han ; L. Hemachandra ; J. Kobler ; A. Lozano ; M. Mundhenk ; M. Ogiwara ; U. Schoening ; R. Silvestri ; T. Thierauf1：

On average P vs. average NP / J. Belanger ; J. Wang2：

Upper and lower bounds for certain graph accessibility problems on bounded alternating omega-branching programs / C. Meinel ; S. Waack3：

Bounded reductions / H. Buhrman ; E. Spaan ; L. Torenvliet4：

On the non-uniform complexity of the graph isomorphism problem / J. Toran5：

The complexity of space bounded interactive proof systems / A. Condon6：

続きを見る

ブックレビュー

類似資料:

1 図書 The graph isomorphism problem : its structural complexity (: us ; : gw) Köbler, Johannes, 1958-, Schöning, Uwe, 1955-, Torán, Jacobo, 1962- Birkhäuser	7 図書 Computational complexity theory Hartmanis, Juris, American Mathematical Society, American Mathematical Society Short Course "Computational Complexity … American Mathematical Society
2 図書 Recursion theory week : proceedings of a conference held in Oberwolfach, FRG, March 19-25, 1989 (: gw ; : us) Ambos-Spies, K. (Klaus), Müller, G. H. (Gert Heinz), 1923-, Sacks, Gerald E., 1933- Springer-Verlag	8 図書 Theories of computational complexity Calude, Cristian, 1952- North-Holland
3 電子ブック Recursion Theory Week Klaus Ambos-Spies, Müller, Gert H., Sacks, Gerald E. SpringerLink Books - AutoHoldings, Springer Berlin Heidelberg	9 図書 Advances in computational complexity theory Cai, Jin-yi, 1961- American Mathematical Society
4 図書 Algorithms and complexity Wilf, Herbert S., 1931- Prentice-Hall	10 図書 Introduction to the theory of complexity Bovet, Daniel P, Crescenzi, Pierluigi Prentice Hall
5 図書 The computational complexity of logical theories (: Berlin ; : New York) Ferrante, Jeanne, 1949-, Rackoff, Charles W., 1948- Springer-Verlag	11 図書 Arithmetic, proof theory, and computational complexity Clote, Peter, Krajíček, Jan Clarendon Press
6 図書 Complexity, logic, and recursion theory Sorbi, Andrea, 1956- Marcel Dekker	12 電子ブック Complexity and Structure Schöning, Uwe., SpringerLink (Online service)