Home › Entities › doctoral_thesis › Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics

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

doctoral thesis by Sivaramakrishnan Natarajan Ramamoorthy, Computer Science & Engineering, University of Washington, 2020
Place doctoral_thesis Q113668412
Press Enter · cited answer in seconds

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

Summary

Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics is a doctoral thesis[1].

Key Facts

  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics authored Sivaramakrishnan Natarajan Ramamoorthy[2].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's instance of is recorded as doctoral thesis[3].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's OCLC number is recorded as 1155058162[4].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's language of work or name is recorded as English[5].
  • +2020-00-00T00:00:00Z marks the founding of Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics[6].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's work available at URL is recorded as http://hdl.handle.net/1773/45470[7].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q1069725', 'amount': '+133'}[8].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q56761382', 'amount': '+8'}[9].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's Handle ID is recorded as 1773/45470[10].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's title is recorded as Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics[11].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's thesis submitted to is recorded as University of Washington[12].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's on focus list of Wikimedia project is recorded as WikiProject PCC Wikidata Pilot/University of Washington[13].
  • Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's thesis committee member is recorded as Anup Rao[14].

Body

Designation and Status

Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics's instance of is recorded as doctoral thesis[3].

History and Context

+2020-00-00T00:00:00Z marks the founding of Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics[6].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . WorldCat. Retrieved . wikidata.org.
  2. [2] ↑ . WorldCat. Retrieved . wikidata.org.
  3. [4] ↑ . WorldCat. Retrieved . wikidata.org.
  4. [5] ↑ . WorldCat. Retrieved . wikidata.org.
  5. [6] ↑ . WorldCat. Retrieved . wikidata.org.
  6. [7] ↑ . WorldCat. Retrieved . wikidata.org.
  7. [8] ↑ . WorldCat. Retrieved . wikidata.org.
  8. [9] ↑ . WorldCat. Retrieved . wikidata.org.
  9. [10] ↑ . WorldCat. Retrieved . wikidata.org.
  10. [11] ↑ . WorldCat. Retrieved . wikidata.org.
  11. [12] ↑ . WorldCat. Retrieved . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . WorldCat. Retrieved . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics. Retrieved May 3, 2026, from https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics
MLA “Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics.
BibTeX @misc{4ortxyz_lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics}}, year = {2026}, url = {https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics — https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/lower-bounds-in-computational-complexity-from-information-theory-algebra-and-combinatorics · Last refreshed: