On the guessing number of shift graphs

Authors:
Taoyang Wu;Peter Cameron;Søren Riis
Affiliations:
Department of Computer Science and School of Mathematical Sciences, Queen Mary, University of London, London, E1 4NS, UK;School of Mathematical Sciences, Queen Mary, University of London, London, E1 4NS, UK;Department of Computer Science, Queen Mary, University of London, London, E1 4NS, UK
Venue:
Journal of Discrete Algorithms
Year:
2009

Citing 5
Cited 0

Why is Boolean complexity theory difficult?

Poceedings of the London Mathematical Society symposium on Boolean function complexity
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
Communication complexity

Communication complexity
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Reversible and Irreversible Information Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate guessing number, a relatively new concept linked to network coding and certain long standing open questions in circuit complexity. Here we study the bounds and a variety of properties concerning this parameter. As an application, we obtain the lower and upper bounds for shift graphs, a subclass of directed circulant graphs.