Sökning: "NP-completeness"

Hittade 2 avhandlingar innehållade ordet NP-completeness.

1. 1. Relaxation in constraint satisfaction problems

   Författare :Pontus Svenson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computational complexity; spin glasses; graph colouring; NP-completeness; relaxation; boolean satisfiability;

   Sammanfattning : .... LÄS MER

3. 2. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

   Författare :Thatchaphol Saranurak; Danupon Nanongkai; Piotr Sankowski; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

   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