2412 search results - page 77 / 483 » Which Problems Have Strongly Exponential Complexity |
131
click to vote
CSFW
2006
IEEE
15 years 6 months ago
2006
IEEE
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
As the Internet grows exponentially, scalable high performance routers and switches on backbone are required to provide a large number of ports, higher throughput, lower delay late...
116
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
123
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
94
Voted
CSL
1999
Springer
15 years 4 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...