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 140 found      Go to page: 1 2 3 4 > >>

[1] Ketan D. Mulmuley. Geometric complexity theory V: Efficient algorithms for Noether normalization. J. Amer. Math. Soc. 30 (2017) 225-309.
Abstract, references, and article information   
View Article: PDF

[2] 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. 367 (2015) 7517-7563.
Abstract, references, and article information   
View Article: PDF

[3] 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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17] 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
This article is available free of charge

[18] 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

[19] 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

[20] 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

[21] Luca Trevisan. Pseudorandomness---Part II. IAS/Park City Mathematics Series 10 (2004) 287-314.
Book volume table of contents
View Article: PDF

[22] Madhu Sudan. Probabilistically checkable proofs. IAS/Park City Mathematics Series 10 (2004) 349-389.
Book volume table of contents
View Article: PDF

[23] Paul Beame. Proof complexity. IAS/Park City Mathematics Series 10 (2004) 199-246.
Book volume table of contents
View Article: PDF

[24] Salil Vadhan. Probabilistic proof systems---Part I. IAS/Park City Mathematics Series 10 (2004) 315-348.
Book volume table of contents
View Article: PDF

[25] Avi Wigderson. Average case complexity. IAS/Park City Mathematics Series 10 (2004) 89-99.
Book volume table of contents
View Article: PDF

[26] Introduction. IAS/Park City Mathematics Series 10 (2004) 1-2.
Book volume table of contents
View Article: PDF

[27] Steven Rudich. Complexity theory: From G\"odel to Feynman. IAS/Park City Mathematics Series 10 (2004) 5-87.
Book volume table of contents
View Article: PDF

[28] Steven Rudich and Avi Wigderson (Editors). Computational Complexity Theory. IAS/Park City Mathematics Series 10 (2004) MR MR2090724.
Book volume table of contents

[29] Ran Raz. Quantum computation. IAS/Park City Mathematics Series 10 (2004) 127-155.
Book volume table of contents
View Article: PDF

[30] Oded Goldreich. Pseudorandomness---Part I. IAS/Park City Mathematics Series 10 (2004) 253-285.
Book volume table of contents
View Article: PDF


Results: 1 to 30 of 140 found      Go to page: 1 2 3 4 > >>


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia