Tight complexity analysis of population protocols with cover times - The ZebraNet example.
Joffroy BeauquierPeva BlanchardJanna BurmanSylvie DelaëtPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- complexity analysis
- lower bound
- theoretical analysis
- upper bound
- computational complexity
- first order logic
- multi party
- database systems
- optimal solution
- worst case
- orders of magnitude
- generalization error bounds
- data sets
- population dynamics
- evolutionary search
- key distribution
- communication protocol
- authentication protocol
- security protocols
- artificial intelligence
- data mining