13603 search results - page 111 / 2721 » On the Computational Complexity of Cut-Reduction |
171
click to vote
JACM
2010
15 years 4 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
185
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
161
click to vote
TRIDENTCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. This paper describes AutoNetkit, an auto-configuration tool for complex network emulations using Netkit, allowing large-scale networks to be tested on commodity hardware....
166
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
173
click to vote
IEEESCC
2010
IEEE
15 years 10 months ago
2010
IEEE
—As the amount of data generated by today’s pervasive environments increases exponentially, there is a stronger need to decipher the important information that is hidden among ...