It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...