AMS eContent Search Results
Matches for: msc=(68Q17) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 30 of 48 found      Go to page: 1 2

[1] Klim Efremenko, J. M. Landsberg, Hal Schenck and Jerzy Weyman. The method of shifted partial derivatives cannot separate the permanent from the determinant. Math. Comp.
Abstract, references, and article information   
View Article: PDF

[2] Peter Bürgisser, Christian Ikenmeyer and Jesko Hüttenhain. Permanent versus determinant: Not via saturations. Proc. Amer. Math. Soc. 145 (2017) 1247-1258.
Abstract, references, and article information   
View Article: PDF

[3] Daniel König, Markus Lohrey and Georg Zetzsche. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. Contemporary Mathematics 677 (2016) 129-144.
Book volume table of contents   
View Article: PDF

[4] Frédérique Bassino, Cyril Nicaud and Pascal Weil. Generic properties of subgroups of free groups and finite presentations. Contemporary Mathematics 677 (2016) 1-43.
Book volume table of contents   
View Article: PDF

[5] Jan Krajíček. A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems. Proc. Amer. Math. Soc. 143 (2015) 4951-4965. MR 3391052.
Abstract, references, and article information   
View Article: PDF

[6] Johannes Mittmann, Nitin Saxena and Peter Scheiblechner. Algebraic independence in positive characteristic: A $p$-adic calculus. Trans. Amer. Math. Soc. 366 (2014) 3425-3450.
Abstract, references, and article information   
View Article: PDF

[7] G. W. Wasilkowski. Average case tractability of approximating $\infty$-variate functions. Math. Comp. 83 (2014) 1319-1336.
Abstract, references, and article information   
View Article: PDF

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

[9] Luca Trevisan. On Khot's unique games conjecture. Bull. Amer. Math. Soc. 49 (2012) 91-111. MR 2869009.
Abstract, references, and article information   
View Article: PDF

[10] Pavel Hrubeš, Avi Wigderson and Amir Yehudayoff. Non-commutative circuits and the sum-of-squares problem. J. Amer. Math. Soc. 24 (2011) 871-898. MR 2784331.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

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

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

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

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

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

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

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

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

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

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

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

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

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

[24] Jiří Matoušek and Anastasios Sidiropoulos. Inapproximability for metric embeddings into $\mathbb{R}^{d}$. Trans. Amer. Math. Soc. 362 (2010) 6341-6365. MR 2678977.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[25] Ning Zhong. Computational unsolvability of domains of attraction of nonlinear systems. Proc. Amer. Math. Soc. 137 (2009) 2773-2783. MR 2497492.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[26] D.S. Graça, N. Zhong and J. Buescu. Computability, noncomputability and undecidability of maximal intervals of IVPs. Trans. Amer. Math. Soc. 361 (2009) 2913-2927. MR 2485412.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[27] J. M. Landsberg. Geometry and the complexity of matrix multiplication. Bull. Amer. Math. Soc. 45 (2008) 247-284. MR 2383305.
Abstract, references, and article information   
View Article: PDF

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

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

[30] Scott Contini, Ernie Croot and Igor E. Shparlinski. Complexity of inverting the Euler function. Math. Comp. 75 (2006) 983-996. MR 2197003.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 30 of 48 found      Go to page: 1 2