1383 search results - page 175 / 277 » On the Complexity of the Interlace Polynomial |
153
click to vote
ACMSE
2006
ACM
16 years 12 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
148
click to vote
SAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
171
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
160
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
186
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...