3690 search results - page 25 / 738 » Computation with classical sequents |
DCC
2007
IEEE
14 years 10 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
WOLLIC
2009
Springer
14 years 5 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
CRYPTO
2010
Springer
13 years 11 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
DIS
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Waka is a form of traditional Japanese poetry with a 1300year history. In this paper we attempt to semi-automatically discover instances of poetic allusion, or more gener...
ISMVL
2003
IEEE
14 years 3 months ago
2003
IEEE
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...