2430 search results - page 140 / 486 » Computing Tutte Polynomials |
128
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
126
click to vote
WG
2001
Springer
15 years 9 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
118
click to vote
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...
130
Voted
EOR
2008
15 years 4 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
190
click to vote
ESOP
2012
Springer
14 years 16 days ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...