1431 search results - page 214 / 287 » The complexity of random ordered structures |
154
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
152
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
290
Voted
DIMACS
1996
15 years 5 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
173
Voted
EUROCRYPT
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
114
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...