Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions
Now showing items 16-18 of 3794
-
Compositionality for Probabilistic Automata
We establish that on the dfomain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder. -
Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free Graphs
(2003-06)We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2^O(sqrt k) n^O(1). Our results apply to a broad family of graph problems, called bidimensional problems, which ... -
Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
(2003-06)Frick and Grohe showed that for each property phi that is definable in first-order logic, and for each class of minor-closed graphs of locally bounded treewidth, there is an O(n^(1+epsilon))-time algorithm deciding whether ...
