19320 search results - page 290 / 3864 » On the complexity of computing determinants |
170
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
173
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
209
click to vote
ORDER
2010
15 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
190
click to vote
TCS
2011
15 years 1 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
185
click to vote
EMMCVPR
2007
Springer
16 years 26 days ago
2007
Springer
This study extended the computation of GLCM (gray level co-occurrence matrix) to a three-dimensional form. The objective was to treat hyperspectral image cubes as volumetric data s...