9842 search results - page 31 / 1969 » The Complexity of the Matching-Cut Problem |
MFCS
1992
Springer
13 years 11 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
IPL
2011
13 years 2 months ago
2011
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
CIE
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...