2233 search results - page 244 / 447 » On the Complexity of Theory Curbing |
195
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
175
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
157
click to vote
AO
2008
15 years 6 months ago
2008
Abstract. We address what is still a scarcity of general mathematical foundations for ontology-based semantic integration underlying current knowledge engineering methodologies in ...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
165
click to vote
ECCC
2010
15 years 6 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...