709 search results - page 72 / 142 » On LR(k)-Parsers of Polynomial Size |
LPNMR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
108
click to vote
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
70
Voted
CCS
2003
ACM
15 years 3 months ago
2003
ACM
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
LPNMR
2001
Springer
15 years 2 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...