[PDF][PDF] The complexity zoo

S Aaronson, G Kuperberg, C Granade - 2005 - cse.unl.edu
What is this? Well its a PDF version of the website www. ComplexityZoo. com typeset in
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …

Using collection descriptions to enhance an aggregation of harvested item-level metadata

M Foulonneau, TW Cole, TG Habing… - … of the 5th ACM/IEEE-CS …, 2005 - dl.acm.org
As an increasing number of digital library projects embrace the harvesting of item-level
descriptive metadata, issues of description granularity and concerns about potential loss of …

On the power of nonlinear secret-sharing

A Beimel, Y Ishai - SIAM Journal on Discrete Mathematics, 2005 - SIAM
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that
only some predefined authorized sets of parties will be able to reconstruct the secret from …

Randomness, provability, and the separation of Monte Carlo time and space

M Karpinski, R Verbeek - Computation Theory and Logic, 2005 - Springer
Separation theorems are essential in complexity theory: looking for strict lower and upper
bounds makes sense only in the context of a hierarchy theorem. For probabilistic complexity …

Modelling, analysis and parallel implementation of an on-line video encoder

I Assayad, P Gerner, S Yovine… - First International …, 2005 - ieeexplore.ieee.org
Video encoding is a fundamental component of a wide range of real-time multimedia
applications. In this paper, we present the fine grain MPEG-4 parallelism and describe a …

Weak theories of linear algebra

N Thapen, M Soltys - Archive for Mathematical Logic, 2005 - Springer
We investigate the theories of linear algebra, which were originally defined to study the
question of whether commutativity of matrix inverses has polysize Frege proofs. We give …

Feasible proofs of matrix properties with Csanky's algorithm

M Soltys - International Workshop on Computer Science Logic, 2005 - Springer
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of
a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from …

The enumerability of P collapses P to NC

A Beygelzimer, M Ogihara - Theoretical computer science, 2005 - Elsevier
We show that one cannot rule out even a single possibility for the value of an arithmetic
circuit on a given input using an NC algorithm, unless P collapses to NC (ie, unless all …

[PDF][PDF] Revisiting the Digits of [pi] and Their Randomness

HC Heien, M Rahman - 2005 - academia.edu
The number that has been studied longer than any other number is π, the ratio of the
circumference of a circle to its diameter. Starting with Archimedes, the first theoretical …

[PDF][PDF] On the Power of Nonlinear Secret-Sharing Ѓ

A Beimel, Y Ishai - 2005 - Citeseer
A secret-sharing scheme enables a dealer to distribute a secret among в parties such that
only some predefined authorized sets of parties will be able to reconstruct the secret from …