CORR
2008
Springer
13 years 11 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
CHI
1997
ACM
14 years 3 months ago
1997
ACM
We present an experiment on cooperative bimanual action. Right-handed subjects manipulated a pair of physical objects, a tool and a target object, so that the tool would touch a t...
BIRTHDAY
2005
Springer
14 years 5 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...