Refuters for algorithms with known lower bounds
Uložené v:
| Názov: | Refuters for algorithms with known lower bounds |
|---|---|
| Autori: | Moreno Peñarrubia, Félix |
| Prispievatelia: | Atserias, Albert, Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| Informácie o vydavateľovi: | Universitat Politècnica de Catalunya, 2024. |
| Rok vydania: | 2024 |
| Predmety: | Computational complexity, Classificació AMS::68 Computer science, Àrees temàtiques de la UPC::Matemàtiques i estadística, Computational Complexity, Algorismes, Complexitat computacional, Algorithms |
| Popis: | Proving lower bounds for algorithms on general models of computation is a central yet largely unfulfilled goal in the field of computational complexity. However, for some restricted models of computation strong lower bounds are known. A lower bound for a problem is said to be constructive if there is an efficient algorithm, known as a refuter, that produces inputs on which the algorithm fails. Recent results indicate that constructive lower bounds for restricted models are as difficult to obtain as some lower bounds for general models. The goal of this work is to explore the state of the art of the construction of refuters for problems with known lower bounds. |
| Druh dokumentu: | Master thesis |
| Popis súboru: | application/pdf |
| Jazyk: | English |
| Prístupová URL adresa: | https://hdl.handle.net/2117/415752 |
| Rights: | CC BY NC ND |
| Prístupové číslo: | edsair.dedup.wf.002..c6a91abdc6d4c996890b9d568c7171c0 |
| Databáza: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Proving lower bounds for algorithms on general models of computation is a central yet largely unfulfilled goal in the field of computational complexity. However, for some restricted models of computation strong lower bounds are known. A lower bound for a problem is said to be constructive if there is an efficient algorithm, known as a refuter, that produces inputs on which the algorithm fails. Recent results indicate that constructive lower bounds for restricted models are as difficult to obtain as some lower bounds for general models. The goal of this work is to explore the state of the art of the construction of refuters for problems with known lower bounds. |
|---|