Sciweavers

36781 search results - page 7153 / 7357
» Parameterizing by the Number of Numbers
Sort
View
RC
1998
82views more  RC 1998»
15 years 6 months ago
A Note on Epsilon-Inflation
Abstract. The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the...
Siegfried M. Rump
SCP
1998
112views more  SCP 1998»
15 years 6 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 6 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
15 years 6 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
15 years 6 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
« Prev « First page 7153 / 7357 Last » Next »