1380 search results - page 241 / 276 » A General Polynomial Sieve |
ATAL
2006
Springer
14 years 13 days ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
CCS
2006
ACM
14 years 12 days ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
CCS
2006
ACM
14 years 12 days ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
STOC
2000
ACM
14 years 7 days ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...