American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(68Q15) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 30 of 64 found      Go to page: 1 2 3

[1] Samuel R. Buss, Leszek Aleksander Kołodziejczyk and Konrad Zdanowski. Collapsing modular counting in bounded arithmetic and constant depth propositional proofs. Trans. Amer. Math. Soc.
Abstract, references, and article information   
View Article: PDF

[2] Martijn Baartse and Klaus Meer. Topics in real and complex number complexity theory. Contemporary Mathematics 604 (2013) 1-53.
Book volume table of contents   
View Article: PDF

[3] Oded Goldreich. Using randomness in computation. University Lecture Series 55 (2010) 93-97.
Book volume table of contents
View Article: PDF

[4] Oded Goldreich. Some basic complexity classes. University Lecture Series 55 (2010) 103-105.
Book volume table of contents
View Article: PDF

[5] Oded Goldreich. Hashing functions. University Lecture Series 55 (2010) 79-82.
Book volume table of contents
View Article: PDF

[6] Oded Goldreich. Cryptographic applications of pseudorandom functions. University Lecture Series 55 (2010) 99-102.
Book volume table of contents
View Article: PDF

[7] Oded Goldreich. Derandomization of time-complexity classes. University Lecture Series 55 (2010) 35-45.
Book volume table of contents
View Article: PDF

[8] Oded Goldreich. Introduction. University Lecture Series 55 (2010) 1-9.
Book volume table of contents
View Article: PDF

[9] Oded Goldreich. General-purpose pseudorandom generators. University Lecture Series 55 (2010) 11-34.
Book volume table of contents
View Article: PDF

[10] Oded Goldreich. Special purpose generators. University Lecture Series 55 (2010) 59-75.
Book volume table of contents
View Article: PDF

[11] Oded Goldreich. A generic hard-core predicate. University Lecture Series 55 (2010) 89-92.
Book volume table of contents
View Article: PDF

[12] Oded Goldreich. A Primer on Pseudorandom Generators. University Lecture Series 55 (2010) MR MR2677397.
Book volume table of contents   

[13] Oded Goldreich. Space-bounded distinguishers. University Lecture Series 55 (2010) 47-57.
Book volume table of contents   
View Article: PDF

[14] Oded Goldreich. Concluding remarks. University Lecture Series 55 (2010) 77-78.
Book volume table of contents   
View Article: PDF

[15] Oded Goldreich. On randomness extractors. University Lecture Series 55 (2010) 83-87.
Book volume table of contents   
View Article: PDF

[16] E. A. Hirsch and D. M. Itsykson. An infinitely-often one-way function based on an average-case assumption. St. Petersburg Math. J. 21 (2010) 459-468. MR 2588765.
Abstract, references, and article information   
View Article: PDF

[17] Jaikumar Radhakrishnan and Madhu Sudan. On Dinur's proof of the PCP theorem. Bull. Amer. Math. Soc. 44 (2007) 19-61. MR 2265009.
Abstract, references, and article information   
View Article: PDF

[18] Shlomo Hoory, Nathan Linial and Avi Wigderson. Expander graphs and their applications. Bull. Amer. Math. Soc. 43 (2006) 439-561. MR 2247919.
Abstract, references, and article information
View Article: PDF

[19] Kai-Tai Fang, Dietmar Maringer, Yu Tang and Peter Winker. Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels. Math. Comp. 75 (2006) 859-878. MR 2196996.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[20] Kai-Tai Fang and Gennian Ge. A sensitive algorithm for detecting the inequivalence of Hadamard matrices. Math. Comp. 73 (2004) 843-851. MR 2031409.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[21] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Problems of Section 13. Graduate Studies in Mathematics 47 (2002) 230-234.
Book volume table of contents
View Article: PDF

[22] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Quantum probability. Graduate Studies in Mathematics 47 (2002) 92-100.
Book volume table of contents
View Article: PDF

[23] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Correspondence between classical and quantum computation. Graduate Studies in Mathematics 47 (2002) 60-65.
Book volume table of contents
View Article: PDF

[24] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Problems of Section 11. Graduate Studies in Mathematics 47 (2002) 224-230.
Book volume table of contents
View Article: PDF

[25] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Definition of quantum computation. Examples.. Graduate Studies in Mathematics 47 (2002) 82-92.
Book volume table of contents
View Article: PDF

[26] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Elementary Number Theory. Graduate Studies in Mathematics 47 (2002) 237-250.
Book volume table of contents
View Article: PDF

[27] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. The hierarchy of complexity classes. Graduate Studies in Mathematics 47 (2002) 44-51.
Book volume table of contents
View Article: PDF

[28] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Bases for quantum circuits. Graduate Studies in Mathematics 47 (2002) 65-82.
Book volume table of contents
View Article: PDF

[29] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Problems of Section 10. Graduate Studies in Mathematics 47 (2002) 221-224.
Book volume table of contents
View Article: PDF

[30] A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi. Turing machines. Graduate Studies in Mathematics 47 (2002) 9-17.
Book volume table of contents
View Article: PDF


Results: 1 to 30 of 64 found      Go to page: 1 2 3