1559 search results - page 102 / 312 » Some Group Theory Problems |
146
click to vote
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
152
click to vote
TC
2008
15 years 4 months ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
113
click to vote
TSP
2010
14 years 11 months ago
2010
This paper is first in a series of papers studying a system-theoretic approach to the problem of reconstructing an analog signal from its samples. The idea, borrowed from earlier t...
140
click to vote
PE
2008
Springer
15 years 4 months ago
2008
Springer
This paper investigates the situation where a group of terminals can be simultaneously connected to several base stations using distinct technologies on nonoverlapping frequency b...
143
click to vote
ENGL
2007
15 years 4 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...