Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...