1795 search results - page 207 / 359 » On the Complexity of Circuit Satisfiability |
W2GIS
2005
Springer
14 years 3 months ago
2005
Springer
Traditional GIS tools are well suited for desktop workstations, but need to be adapted in order to satisfy the requirements of mobility. We propose a concept for sketch-based spati...
ICLP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
MICAI
2004
Springer
14 years 3 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...