2430 search results - page 180 / 486 » Computing Tutte Polynomials |
144
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
122
click to vote
MP
1998
15 years 4 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
242
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
169
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
154
click to vote
SBBD
2004
15 years 6 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...