1101 search results - page 180 / 221 » Forcing in proof theory |
150
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
141
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
157
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
177
click to vote
CALC
2001
Springer
15 years 10 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
161
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...