東京農工大学が所蔵する図書や雑誌、電子ブックを検索します。
全国の大学図書館等が所蔵する図書や雑誌を検索します。
国内の学術論文を検索します。
国内の学術機関リポジトリに登録された学術情報を検索します。
国立国会図書館や公共図書館等が提供する資料を検索します。
本学の蔵書を検索した結果です。電子媒体は詳細画面から外部へリンクする事が可能です。
検索キーワード：(件名: #Computational complexity)
該当件数:112件
The nature of computation / Cristopher Moore, Stephan Mertens
: hbk.. - Oxford : Oxford University Press , 2011
図書
Communication complexity and applications / Anup Rao, Amir Yehudayoff
: hardback. - Cambridge : Cambridge University Press , 2020
Theory of computational complexity / Ding-Zhu Du, Ker-I Ko
New York : Wiley , c2000. - (Wiley-Interscience series in discrete mathematics and optimization)
Computational complexity : a conceptual perspective / Oded Goldreich
: hbk. - Cambridge : Cambridge University Press , 2008
A new kind of science / Stephen Wolfram
Champaign, IL : Wolfram Media , c2002
Introduction to the theory of computation / Michael Sipser
: hbk,: pbk. - 3rd ed. - Boston, MA : Cengage Learning , c2013
P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich
: hbk,: pbk. - Cambridge ; New York : Cambridge University Press , 2010
Pseudorandomness and cryptographic applications / Michael Luby
: pbk. - Princeton, N.J. : Princeton University Press , c1996. - (Princeton computer science notes)
Boolean function complexity : advances and frontiers / Stasys Jukna
Berlin : Springer , c2012. - (Algorithms and combinatorics ; v. 27)
Computational complexity and statistical physics / editors, Allon G. Percus, Gabriel Istrate, Cristopher Moore
: pbk. - New York : Oxford University Press , 2006. - (Santa Fe Institute studies in the sciences of complexity)
Boolean domain / Jin-Yi Cai, Xi Chen
Cambridge : Cambridge University Press , c2017. - (Complexity dichotomies for counting problems ; v. 1)
Complexity and real computation / Lenore Blum ... [et al.] ; foreword by Richard M. Karp
New York : Springer , c1998
Branching programs and binary decision diagrams : theory and applications / Ingo Wegener
Philadelphia : Society for Industrial and Applied Mathematics , c2000. - (SIAM monographs on discrete mathematics and applications)
Bounded arithmetic, propositional logic, and complexity theory / Jan Krajíček
Cambridge, England ; New York : Cambridge University Press , 1995. - (Encyclopedia of mathematics and its applications / edited by G.-C. Rota ; v. 60)
Computational complexity of bilinear forms : algebraic coding theory and applications of digital communication systems / Hari Krishna
: us,: gw. - Berlin ; Tokyo : Springer-Verlag , c1987. - (Lecture notes in control and information sciences ; 94)
Foundations of complex systems : emergence, information and prediction / Gregoire Nicolis, Catherine Nicolis
2nd ed. - New Jersey : World Scientific , c2012
Introduction to automata theory, languages, and computation / John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
2nd ed. - Boston : Addison-Wesley , c2001
Information and randomness : an algorithmic perspective / Cristian S. Calude ; forewords by Gregory J. Chaitin and Arto Salomaa
2nd ed., revised and extended. - Berlin ; Tokyo : Springer-Verlag , c2002. - (Texts in theoretical computer science ; An EATCS series)
Hardness of approximation between P and NP / Aviad Rubinstein
: hardcover. - [New York, N.Y.] : Association for Computing Machinery. - [San Rafael, Calif.] : Morgan & Claypool Publishers , c2019. - (ACM books ; #24)
Combinatorial optimization : networks and matroids / Eugene L. Lawler
Fort Worth : Saunders College Pub. , c1976
