2436 search results - page 105 / 488 » Comonadic Notions of Computation |
113
click to vote
JOC
2002
15 years 3 months ago
2002
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
131
click to vote
JSYML
2002
15 years 3 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
130
click to vote
SSPR
2010
Springer
15 years 2 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
113
click to vote
DEBU
2010
15 years 1 months ago
2010
Provenance is often used to validate data, by verifying its origin and explaining its derivation. When searching for "causes" of tuples in the query results or in genera...
174
Voted
AML
2011
14 years 11 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...