504 search results - page 36 / 101 » The Complexity of Symmetry-Breaking Formulas |
125
click to vote
ENTCS
2008
15 years 4 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
138
click to vote
TC
2008
15 years 4 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
112
click to vote
APAL
2004
15 years 4 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
132
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
144
click to vote
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...