9842 search results - page 268 / 1969 » The Complexity of the Matching-Cut Problem |
61
Voted
CIE
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
242
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
73
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
102
Voted
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
104
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...