complexity¶
Complexity bounds for distributed algorithms, fault models (classical + LLM-specific), and decorator-based complexity annotations.
Complexity annotations and bounds for distributed algorithms.
This module provides tools for documenting and analyzing algorithm complexity, including decorators for annotation and utilities for complexity comparison.
Submodules¶
| Module | Description |
|---|---|
annotations |
Decorator-based complexity tracking with ComplexityClass |
bounds |
30+ catalogued bounds across consensus, gossip, leader election, broadcast, and mesh communication |