close
1.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing (TCMF) ; in cooperation with ACM/SIGACT
出版情報: Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2002  xvi, 813 p. ; 28 cm
所蔵情報: loading…
2.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and the Pennsylvania State University
出版情報: New York : Assciation for Computing Machinery, c1976  246 p. ; 28 cm
所蔵情報: loading…
3.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and Computer Science Department, University of California, Los Angeles, California
出版情報: New York, N.Y. : ACM, c1980  447 p. ; 28 cm
所蔵情報: loading…
4.

図書

図書
sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, Wisconsin
出版情報: New York, N.Y. : ACM, c1981  v, 391 p. ; 28 cm
所蔵情報: loading…
5.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computability Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and the University of New Mexico
出版情報: New York : ACM, c1975  265 p. ; 28 cm
所蔵情報: loading…
6.

図書

図書
sponsored by the Association for Computing Machinery Special Interest Group on Automata and Computing Theory, with the cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and the University of Colorado
出版情報: New York : ACM, 1977  314 p. ; 28 cm
所蔵情報: loading…
7.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM Special Interest Group for Automata and Computability Theory, Rice University, Departments of Mathematical Sciences and Electrical Engineering, the University of Houston, Department of Computer Science
出版情報: Long Beach, CA : IEEE Computer Society, c1976  276 p. ; 28 cm
所蔵情報: loading…
8.

図書

図書
sponsored by the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM Special Interest Group for Automata and Computability Theory, and Brown University
出版情報: New York, N.Y. : Institute of Electrical and Electronics Engineers, c1977  v, 269 p. ; 28 cm
所蔵情報: loading…
9.

図書

図書
sponsored by IEEE Computer Society Technical Committee for Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c2000  x, 279 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Committees
Ron Book Prize for Best Student Paper
Time-Space Tradeoff Lower Bounds for Non-Uniform Computation / P. Beame
Time-Space Tradeoffs for Nondeterministic Computation / L. Fortnow ; D. van Melkebeek
A Lower Bound for the Shortest Path Problem / K. Mulmuley ; P. Shah
Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines / I. Tourlakis
BP (f) = O (L (f)[superscript 1+varepsilon]) / O. Giel
The Communication Complexity of Enumeration, Elimination, and Selection / A. Ambainis ; H. Buhrman ; W. Gasarch ; B. Kalyanasundaram ; L. Torenvliet
The Query Complexity of Order-Finding / R. Cleve
On the Complexity of Some Problems on Groups Input as Multiplication Tables / D. Barrington ; P. Kadau ; K-J. Lange ; P. McKenzie
The Complexity of Tensor Calculus / C. Damm ; M. Holzer
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity / T. Hoang ; T. Thierauf
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture / J. Kahn ; M. Saks ; C. Smyth
Computational Complexity and Phase Transitions / G. Istrate
An Application of Matroid Theory to the SAT Problem / O. Kullmann
New Bounds for the Language Compression Problem / S. Laplante ; P. Miltersen
Combinatorial Interpretation of Kolmogorov Complexity / A. Romashchenko ; A. Shen ; N. Vereshchagin
Independent Minimum Length Programs to Translate between Given Strings / N. Vereschagin ; M. Vyugin
A Survey of Optimal PCP Characterizations of NP / L. Trevisan
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error / V. Kabanets
Dimension in Complexity Classes / J. Lutz
Average Case Complexity of Unbounded Fanin Circuits / A. Jakoby ; R. Reischuk
On the Hardness of 4-Coloring a 3-Colorable Graph / V. Guruswami ; S. Khanna
Deciding the K-Dimension is PSPACE-Complete / M. Schaefer
Integer Circuit Evaluation is PSPACE-Complete / K. Yang
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition / P. Duris ; J. Hromkovic ; K. Inoue
On the Complexity of Intersecting Finite State Automata / G. Karakostas ; R. Lipton ; A. Viglas
On the Complexity of the Monotonicity Verification / A. Voronenko
What Complexity and Cryptography Can Teach Each Other / R. Impagliazzo
Quantum Kolmogorov Complexity / A. Berthiaume ; W. van Dam
On the Complexity of Quantum ACC / F. Green ; S. Homer ; C. Pollett
Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State / P. Vitanyi
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity / R. de Wolf
Author Index
Preface
Committees
Ron Book Prize for Best Student Paper
10.

図書

図書
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS
出版情報: Los Alamitos, Calif. : IEEE Computer Society, c1999  x, 241 p. ; 28 cm
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼