Sökning: "NP-completeness"
Hittade 2 avhandlingar innehållade ordet NP-completeness.
1. Relaxation in constraint satisfaction problems
Sammanfattning : .... LÄS MER
2. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections
Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER
Resultatsidor:
1