58 search results - page 4 / 12 » Relating Equivalence and Reducibility to Sparse Sets |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
ITC
2003
IEEE
14 years 28 days ago
2003
IEEE
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
EH
2002
IEEE
14 years 18 days ago
2002
IEEE
Fluid flow in porous media is a dynamic process that is traditionally modeled using PDE (Partial Differential Equations). In this approach, physical properties related to fluid fl...
APAL
2010
13 years 7 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...