Index of /courses/cot6410/Spring2020/SampleTopics/NP-Hard

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[ ]AutomatingResolution.pdf2020-03-25 20:29 249K 
[ ]CLAIMED_ALMALKI_NP_MightyAndSimplex.pdf2020-03-25 20:29 278K 
[ ]CLAIMED_ALNAJDI_Geometric Systems of Unbiased Representatives.pdf2020-04-02 11:02 394K 
[ ]CLAIMED_ALSOFYANI_TileSet.pdf2020-03-25 20:29 307K 
[ ]CLAIMED_ALYAMI_Link Crossing Number is NP-hard.pdf2020-03-26 22:27 345K 
[ ]CLAIMED_BIONDI_Manipulating Districts to Win Elections.pdf2020-03-25 20:29 434K 
[ ]CLAIMED_GRAY_The Burning Number of Directed Graphs Bounds and Computational Complexity.pdf2020-03-25 20:29 198K 
[ ]CLAIMED_SANAULLAH_Decisions, Counterfactual Explanations and Strategic Behavior.pdf2020-03-25 20:29 1.1M 
[ ]CLAIMED_SMITH_PancakeFlippingpdf.pdf2020-03-25 20:29 499K 
[ ]CLAIMED_SRIDHAR_Airline Crew Pairing Optimization.pdf2020-03-25 20:29 792K 
[ ]CLAIMED_YIN_Escaping Cannibalization.pdf2020-03-25 20:29 700K 
[ ]CLAIMED_YUDHA_NOMA- NP-hardness, Competitiveness and Learning.pdf2020-03-25 20:29 420K 
[ ]ComplexityOfEquilibria.pdf2020-03-25 20:29 798K 
[ ]Hardness of equations over finite solvable groups.pdf2020-03-25 20:29 643K 
Apache/2.4.52 (Ubuntu) Server at cs.ucf.edu Port 80