2412 search results - page 151 / 483 » Which Problems Have Strongly Exponential Complexity |
159
click to vote
COMPSAC
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
145
Voted
CONEXT
2007
ACM
15 years 7 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
136
click to vote
ASWEC
2001
IEEE
15 years 7 months ago
2001
IEEE
Static analysis is a tremendous help when trying to find faults in complex software. Writing multi-threaded programs is difficult, because the thread scheduling increases the prog...
123
Voted
AAAI
2000
15 years 4 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
137
click to vote
PODS
2000
ACM
15 years 7 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...