Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics
(Q113668412)
doctoral thesis by Sivaramakrishnan Natarajan Ramamoorthy, Computer Science & Engineering, University of Washington, 2020
doctoral thesis by Sivaramakrishnan Natarajan Ramamoorthy, Computer Science & Engineering, University of Washington, 2020
Language:
Current Data About
Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics
| (P31) |
(Q187685)
|
||||||||
| (P50) |
(Q113667815)
|
||||||||
| (P407) |
(Q1860)
|
||||||||
| (P571) |
+2020-00-00T00:00:00Z
|
||||||||
| (P953) |
http://hdl.handle.net/1773/45470
|
||||||||
| (P1104) |
133
8
|
||||||||
| (P1476) |
"Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics" (language: en)
|
||||||||
| (P4101) |
(Q219563)
|
||||||||
| (P5008) |
(Q98970039)
|
||||||||
| (P9161) |
(Q102439971)
|
other details
| description | doctoral thesis by Sivaramakrishnan Natarajan Ramamoorthy, Computer Science & Engineering, University of Washington, 2020 |
External Links
| (P243) |
1155058162
|
| (P1184) |
1773/45470
|