# Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics

> doctoral thesis by Sivaramakrishnan Natarajan Ramamoorthy, Computer Science & Engineering, University of Washington, 2020

**Wikidata**: [Q113668412](https://www.wikidata.org/wiki/Q113668412)  
**Source**: https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics


## References

1. WorldCat