9842 search results - page 270 / 1969 » The Complexity of the Matching-Cut Problem |
104
Voted
STOC
2006
ACM
16 years 27 days ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
111
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
84
Voted
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
137
click to vote
WADS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
129
Voted
WDAG
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...