43 search results - page 6 / 9 » acs 2000 |
CORR
2000
Springer
13 years 7 months ago
2000
Springer
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
AC
2000
Springer
13 years 11 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
HICSS
2000
IEEE
13 years 11 months ago
2000
IEEE
With the recent trend towards deregulating power systems around the world, transfer capability computation emerges as the key issue to a smoothly running power market with multipl...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...