29908 search results - page 317 / 5982 » On the Complexity of |
135
click to vote
KDD
1997
ACM
15 years 11 months ago
1997
ACM
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
162
Voted
ANTS
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
150
click to vote
FSTTCS
1993
Springer
15 years 11 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
210
click to vote
ISAAC
1993
Springer
15 years 11 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
162
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...