2436 search results - page 221 / 488 » Comonadic Notions of Computation |
167
click to vote
COCO
2007
Springer
16 years 27 days ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
159
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
171
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
198
click to vote
CSL
2007
Springer
16 years 26 days ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
175
click to vote
DFG
2007
Springer
16 years 26 days ago
2007
Springer
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...