16666 search results - page 2537 / 3334 » Descriptive and Computational Complexity |
220
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
191
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
187
click to vote
HCW
1999
IEEE
15 years 12 months ago
1999
IEEE
We present a new software technology for on-line performance analysis and visualization of complex parallel and distributed systems. Often heterogeneous, these systems need capabi...
213
click to vote
SIGMOD
1999
ACM
15 years 12 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
212
click to vote
SPAA
1999
ACM
15 years 12 months ago
1999
ACM
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...