1998 search results - page 268 / 400 » Complexity of the Cover Polynomial |
104
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
114
click to vote
CN
1998
15 years 14 days ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
112
click to vote
IACR
2011
14 years 13 days ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
127
click to vote
AAMAS
2012
Springer
13 years 8 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
127
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...