1730 search results - page 290 / 346 » Algebra and Computation |
RANDOM
1997
Springer
14 years 2 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
ICS
1993
Tsinghua U.
14 years 2 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
LCPC
1993
Springer
14 years 2 months ago
1993
Springer
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
VLDB
1989
ACM
14 years 2 months ago
1989
ACM
paper is concerned with ways of specifying situations and evaluating them efficiently. The techniques described in this paper were developed as part of the HiPAC (High Performance...
SPAA
1990
ACM
14 years 2 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...