14699 search results - page 320 / 2940 » Complexity and Cognitive Computing |
130
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
138
click to vote
JAIR
2008
15 years 4 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...
191
click to vote
AMSTERDAM
2009
15 years 2 months ago
2009
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
167
click to vote
DCC
2011
IEEE
14 years 11 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...