1383 search results - page 175 / 277 » On the Complexity of the Interlace Polynomial |
168
Voted
ACMSE
2006
ACM
16 years 1 months 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...
161
Voted
SAS
2005
Springer
16 years 15 days 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...
184
Voted
VLDB
2005
ACM
16 years 15 days 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...
177
click to vote
WABI
2005
Springer
16 years 15 days 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...
200
Voted
COMPGEOM
2004
ACM
16 years 14 days 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...