504 search results - page 26 / 101 » The Complexity of Symmetry-Breaking Formulas |
189
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
176
click to vote
ENTCS
2008
15 years 7 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
189
Voted
JAIR
2008
15 years 7 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
235
click to vote
DCC
2011
IEEE
15 years 2 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
140
Voted
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
16 years 1 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...