787 search results - page 91 / 158 » Polynomial Constants are Decidable |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
CSL
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
FUN
2007
Springer
14 years 3 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...