2430 search results - page 365 / 486 » Computing Tutte Polynomials |
153
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
134
click to vote
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
148
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
199
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
219
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...