PPT-Parameterised Complexity
SO
calandra-battersby
Published 2017-05-20 | 5494 Views
Algorithms and Networks 20162017 Johan M M van Rooij Hans L Bodlaender This lecture Classical complexity P vs NP Conditional nonexistence proofs Parameterised complexity
Download Presentation
Download Presentation The PPT/PDF document "Parameterised Complexity" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.