356 search results - page 7 / 72 » Parallelizing time with polynomial circuits |
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
CONCUR
1998
Springer
14 years 3 days ago
1998
Springer
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
MOR
2000
13 years 7 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
COCO
1998
Springer
14 years 3 days ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...