1089 search results - page 46 / 218 » Randomness and Reducibility |
164
Voted
COMBINATORICA
2011
14 years 2 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
138
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
118
Voted
TCC
2012
Springer
13 years 10 months ago
2012
Springer
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
ISLPED
1999
ACM
15 years 7 months ago
1999
ACM
The charge recovery databus is a scheme which reduces energy consumption through the application of adiabatic circuit techniques. Previous work 2 gives a solid theoretical analysi...
109
Voted
AML
2006
15 years 2 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...