1445 search results - page 21 / 289 » Uniformly Hard Languages |
ICFCA
2010
Springer
14 years 2 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
According to one common view, information security comes down to technical measures. Given better access control policy models, formal proofs of cryptographic protocols, approved ...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...