371 search results - page 14 / 75 » Partition Theorems and Computability Theory |
SIAMCOMP
2010
14 years 8 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
79
Voted
FCT
2007
Springer
15 years 1 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
FUIN
1998
14 years 9 months ago
1998
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...