1368 search results - page 125 / 274 » Generalized Rook Polynomials |
160
Voted
LPNMR
2004
Springer
15 years 10 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...
166
click to vote
AGP
2003
IEEE
15 years 10 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 ...
155
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
119
click to vote
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
127
click to vote
EUROCRYPT
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...