1199 search results - page 218 / 240 » Parameterized Proof Complexity |
149
Voted
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
125
Voted
CCS
2006
ACM
15 years 6 months 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...
104
Voted
MFCS
1995
Springer
15 years 6 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
144
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
138
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...