9842 search results - page 129 / 1969 » The Complexity of the Matching-Cut Problem |
COCOON
2008
Springer
13 years 12 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,...
COLT
2008
Springer
13 years 12 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...
WSC
2004
13 years 11 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...
CORR
2010
Springer
13 years 10 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...
TAPSOFT
1997
Springer
14 years 2 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...