29908 search results - page 430 / 5982 » On the complexity of communication complexity |
153
click to vote
FSTTCS
1993
Springer
15 years 11 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
214
click to vote
ISAAC
1993
Springer
15 years 11 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
165
click to vote
FPCA
1989
15 years 11 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
136
click to vote
MFCS
1990
Springer
15 years 11 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
165
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...