1763 search results - page 95 / 353 » A Formalization of Polytime Functions |
IAW
2003
IEEE
15 years 3 months ago
2003
IEEE
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
COLT
1993
Springer
15 years 2 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
CRYPTO
1991
Springer
15 years 1 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
IFM
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we introduce a common semantic framework for developing and formally modeling use cases and task models. Use cases are the notation of choice for functional require...