117 lines
3.7 KiB
BibTeX
117 lines
3.7 KiB
BibTeX
@online{wolframnphard,
|
|
author = "Eric W. Weisstein",
|
|
title = "NP-Hard Problem",
|
|
publisher = "MathWorld = A Wolfram Web Resource",
|
|
url = "https://mathworld.wolfram.com/NP-HardProblem.html",
|
|
addendum = "(Accessed: 2023-03-03)"
|
|
}
|
|
@online{wolfram,
|
|
author = "David Terr",
|
|
title = "Polynomial Time",
|
|
url = "https://mathworld.wolfram.com/PolynomialTime.html",
|
|
addendum = "(Accessed: 2023-03-03)",
|
|
keywords = "p"
|
|
}
|
|
@online{slides,
|
|
author = "Frank Glavin",
|
|
title = "Topic Three: Algorithm Analysis \& Dynamic Programming Part II",
|
|
addendum = "Uploaded to Blackboard: 2023-02-17",
|
|
keywords = "p,np,"
|
|
}
|
|
@online{floydnondeterm,
|
|
author = "Robert W. Floyd",
|
|
title = "Nondeterministic Algorithms",
|
|
publisher = "Journal of the ACM",
|
|
date = "1967-10",
|
|
doi = "10.1145/321420.321422"
|
|
}
|
|
@online{britnpcomp,
|
|
author = "William L. Hosch",
|
|
title = "NP-complete problem",
|
|
publisher = "Encyclopedia Britannica",
|
|
date = "2023-03-10",
|
|
url = "https://www.britannica.com/science/NP-complete-problem#ref97458",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@online{techopedia,
|
|
title = "Non-Deterministic Polynomial Time (NP)",
|
|
publisher = "techopedia",
|
|
date = "2019-08-29",
|
|
url = "https://www.techopedia.com/definition/21028/non-deterministic-polynomial-time-np",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@online{fortnow,
|
|
author = "Lance Fortnow",
|
|
title = "The status of the P versus NP problem",
|
|
publisher = "Communications of the ACM",
|
|
date = "2009",
|
|
doi = " 10.1145/1562164.1562186"
|
|
}
|
|
@online{britpvsnpproblem,
|
|
author = "William L. Hosch",
|
|
title = "P versus NP problem",
|
|
publisher = "Encyclopedia Britannica",
|
|
date = "2023-02-22",
|
|
url = "https://www.britannica.com/science/P-versus-NP-problem",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@online{salesman,
|
|
author = "Stephan C. Carlson",
|
|
title = "Travelling salesman Problem",
|
|
publisher = "Encyclopedia Britannica",
|
|
date = "2023-02-05",
|
|
url = "https://www.britannica.com/science/traveling-salesman-problem",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@book{interact,
|
|
author = "Michael R. Garey \& David S. Johnson",
|
|
title = "Computers \& Intractability: A Guide to the Theory of NP-Completeness",
|
|
publisher = "W.H. Freeman",
|
|
date = "1979",
|
|
isbn = "0-7167-1045-5"
|
|
}
|
|
@online{halting,
|
|
author = "Karleigh Moore et al.",
|
|
title = "Halting Problem",
|
|
publisher = "Brilliant",
|
|
url = "https://brilliant.org/wiki/halting-problem/",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@online{npcompbrit,
|
|
author = "Erik Gregersen",
|
|
title = "NP-Complete Problem",
|
|
publisher = "Encyclopedia Britannica",
|
|
date = "2023-03-10",
|
|
url = "https://www.britannica.com/science/traveling-salesman-problem",
|
|
addendum="(Accessed: 2023-03-12)"
|
|
}
|
|
@online{cook,
|
|
author = "Stephen Cook",
|
|
title = "The complexity of theorem-proving procedures",
|
|
publisher = "Proceedings of the Third Annual ACM Symposium on Theory of Computing",
|
|
date = "1971",
|
|
doi = "10.1145/800157.805047"
|
|
}
|
|
@online{pvsnpbrit,
|
|
author = "William L. Hosch",
|
|
title = "P versus NP problem",
|
|
publisher = "Encyclopedia Britannica",
|
|
date = "2023-02-22",
|
|
url = "https://www.britannica.com/science/P-versus-NP-problem",
|
|
addendum="(Accessed: 2023-03-03)"
|
|
}
|
|
@online{poll,
|
|
author = "William I. Gasarch",
|
|
title = "The P=?NP poll",
|
|
publisher = "SIGACT News",
|
|
date = "2002-06",
|
|
doi = "10.1145/564585.564599"
|
|
}
|
|
@online{sipser,
|
|
author = "Michael Sipser",
|
|
title = "The history \& status of the P versus NP question",
|
|
publisher = "Proceedings of the twenty-fourth annual ACM Symposium on Theory of Computing",
|
|
date = "1992-07",
|
|
doi = "10.1145/129712.129771"
|
|
}
|