4066 search results - page 146 / 814 » Almost Complete Sets |
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
169
click to vote
TOCL
2011
15 years 1 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
181
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
310
click to vote
MHCI
2009
Springer
15 years 11 months ago
2009
Springer
Touch-sensitive displays seem like a natural and promising option for dealing with the increasing complexity of current in-vehicle information systems (IVIS), but since they can h...
192
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...