9842 search results - page 129 / 1969 » The Complexity of the Matching-Cut Problem |
125
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
103
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
112
click to vote
WSC
2004
15 years 4 months ago
2004
GoldSim is a powerful and flexible Windows-based computer program for carrying out probabilistic simulations of complex systems to support management and decisionmaking in enginee...
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
123
click to vote
TAPSOFT
1997
Springer
15 years 7 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...