Sciweavers

429 search results - page 11 / 86
» Permutative Additives and Exponentials
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Arithmetic Circuits: A Chasm at Depth Four
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
Manindra Agrawal, V. Vinay
AINA
2003
IEEE
14 years 27 days ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
MFCS
1997
Springer
13 years 11 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a signiļ¬cant simpliļ¬...
Uwe Schöning
LICS
2009
IEEE
14 years 2 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to VĀØoge and JurdziĀ“nski. First, we informally show which stru...
Oliver Friedmann
NIPS
2004
13 years 9 months ago
Semi-parametric Exponential Family PCA
We present a semi-parametric latent variable model based technique for density modelling, dimensionality reduction and visualization. Unlike previous methods, we estimate the late...
Sajama, Alon Orlitsky