Filter by

  • Publication Year
  • Availability
  • Attachment
  • Collection Type
    See More
  • General Material Designation
    See More
  • Location
    See More
  • Language
Found 4 from your keywords: subject="Theory of Computation...
cover
Quantum computational number theory
Comment Share
Yan, Song Y.

This book provides a comprehensive introduction to advanced topics in the computational and algorithmic aspects of number theory, focusing on applications in cryptography. Readers will learn to develop fast algorithms, including quantum algorithms, to solve various classic and modern number theoretic problems. Key problems include prime number generation, primality testing, integer factorizatio…

Edition
-
ISBN/ISSN
9783319798462
Collation
ix, 252 hlm.: ilus.; 23 cm
Series Title
-
Call Number
512.7 YAN q
cover
Principles and metdhods of quantum information technologies
Comment Share
Semba, KouichiYamamoto, Yoshihisa

Contents: Part I Quantum communication 1 Quatum information theory for quantum communication 2 Quantum communication for the ultimate capacity and security 3 Quantum communication for the experiments over optical fiber 4 Spin-photo entanglement in semiconductor quantum dots: towards solid-state-based quantum repeaters Part II Quatum metrology and sensing 5 Optical lattice c…

Edition
--
ISBN/ISSN
9784431557555
Collation
xi, 624 hal.; ilus.; 24 cm
Series Title
--
Call Number
R006.3843 YAM p
cover
Algorithmic randomness and complexity
Comment Share
Downey, Rodney G.Hirschfeldt, Denis R.

This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur and has seen rapid growth in recent years. br Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discret…

Edition
-
ISBN/ISSN
9780387955674
Collation
xxviii, 854 hlm.; 26 cm.
Series Title
-
Call Number
511.3 DOW a
cover
Modern cryptography, probabilistic proofs and pseudorandomness
Comment Share
Goldreich, Oded

The interplay between randomness and computation is one of the most fas cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the…

Edition
-
ISBN/ISSN
354064766X
Collation
xv, 182 hlm.; 23 cm.
Series Title
-
Call Number
005.8 GOL m