Stable networks and product graphs
著者
書誌事項
Stable networks and product graphs
（Memoirs of the American Mathematical Society, no. 555）
American Mathematical Society, 1995
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliography (p. 213-220) and index
"July 1995, volume 116, number 555 (second of 4 numbers)" -- T.p.
内容説明・目次
内容説明
A network is a collection of gates, each with many inputs and many outputs, where links join individual outputs to individual inputs of gates; the unlinked inputs and outputs of gates are viewed as inputs and outputs of the network. A stable configuration assigns values to inputs, outputs, and links in a network, to ensure that the gate equations are satisfied. The problem of finding stable configurations in a network is computationally hard. In this work, Feder restricts attention to gates that satisfy a non-expansiveness condition requiring small perturbations at the inputs of a gate to have only a small effect at the outputs of the gate. The stability question on the class of networks satisfying this local non-expansiveness condition contains stable matching as a main example, and defines the boundary between tractable and intractable versions of network stability.
「Nielsen BookData」 より
