Topological Lower Bounds in Complexity Theory
The first goal of this thesis is to present two different methods, originally developed by Björner, Lovász and Yao [4], for proving lower bounds on the worst-case complexity in the linear decision tree model, by applying them to the k-EQUAL PROBLEM. Both methods are based on the computation of topol...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Matematik (Avd.)
2015
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-161067 |