106 search results - page 5 / 22 » Exponential Time Complexity of the Permanent and the Tutte P... |
PODS
2004
ACM
15 years 9 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
COLOGNETWENTE
2010
14 years 8 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
73
Voted
CP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
55
Voted
IANDC
2010
14 years 8 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
CSL
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...