𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The time complexity of deterministic broadcast radio networks

✍ Scribed by F.K. Hwang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
237 KB
Volume
60
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Deterministic broadcasting time with par
Deterministic broadcasting time with partial knowledge of the network
✍ Gianluca De Marco; Andrzej Pelc πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 143 KB

We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node v knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from v. Apart from that, each n

Distributed broadcast in radio networks
Distributed broadcast in radio networks of unknown topology
✍ Andrea E.F. Clementi; Angelo Monti; Riccardo Silvestri πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 353 KB

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a ΓΏxed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadca

On the Deterministic Complexity of Facto
On the Deterministic Complexity of Factoring Polynomials
✍ Shuhong Gao πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting