209 search results - page 39 / 42 » The Computational Complexity of Weak Saddles |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
VIZSEC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
PODC
2000
ACM
13 years 12 months ago
2000
ACM
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
SP
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...