1368 search results - page 144 / 274 » Generalized Rook Polynomials |
137
Voted
ICDT
2003
ACM
15 years 9 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
127
Voted
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
137
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
126
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
180
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...