PPT-Parameterised Complexity
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
"Parameterised Complexity" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.