1068 search results - page 61 / 214 » On Space Bounded Server Algorithms |
135
click to vote
ICS
2010
Tsinghua U.
15 years 8 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
127
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
125
click to vote
CJ
2010
15 years 4 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
115
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
147
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...