11151 search results - page 2021 / 2231 » On the Complexity of Model Expansion |
154
click to vote
RSA
2010
15 years 5 months ago
2010
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
205
click to vote
RULEML
2010
Springer
15 years 5 months ago
2010
Springer
Rule bases are common in many business rule applications, clinical decision support programs, and other types of intelligent systems. As the size of the rule bases grows and the in...
178
click to vote
SCN
2010
Springer
15 years 5 months ago
2010
Springer
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
186
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
126
click to vote
SYNTHESE
2010
15 years 4 months ago
2010
In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua ch...