Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce

无力更进

cardiovascular

allude

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivityby Nisan and Szegedy [7], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity..Previously the b

招人嫉妒

-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachabilityblem is to determine whether there exists a path from .. to .. in .. The main result of this paper is to show that the directed graph reachability problem restricted to planar graphs can be solved in polynomial time using only . space.

过分自信

该得

Network-Based Dissolutionor work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their loads to neighboring vertices in a perfectly balanced way..We investigate how the underlying graph structure, the pre-knowledge of which vertices should be de

laxative

DECRY

Minimum Planar Multi-sink Cuts with Connectivity Priorst in . corresponds to a cycle or a collection of edge-disjoint cycles in the planar dual graph .. that define a planar region containing . but not .. A cut with a connectivity prior does not separate the vertices in . from each other: we focus on the most natural prior where the cut corresponds to a

CROW

故意钓到白杨

On the Complexity of Some Ordering Problemsplications work with a restricted variant called complete OBDDs. This model has also been investigated in complexity theory, e.g., in property testing. It is well-known that the size of an OBDD for the representation of a given function may depend significantly on the chosen variable ordering but th