query: Algorithm to determine if given algorithm runs in polynomial time
positive_passages.docid: 149955
positive_passages.text: Are runtime bounds in P decidable? (answer: no)
negative_passages.docid: 98273
negative_passages.text: minimal polynomial of powers of a matrix
negative_passages.docid: 46550
negative_passages.text: Proving an 'obvious' Ramsey upperbound
negative_passages.docid: 111345
negative_passages.text: Best algorithm for detecting cycles in a directed graph
negative_passages.docid: 129653
negative_passages.text: Solving a polynomial with grouping
negative_passages.docid: 7847
negative_passages.text: Best way to determine if a sequence is in another sequence?
negative_passages.docid: 94703
negative_passages.text: Time complexity and optimality
negative_passages.docid: 84355
negative_passages.text: Methods to see if a polynomial is irreducible
negative_passages.docid: 107781
negative_passages.text: Detecting perfect squares faster than by extracting square root
negative_passages.docid: 119257
negative_passages.text: Which package to use for writing algorithms?
negative_passages.docid: 71261
negative_passages.text: Factoring a hard polynomial
negative_passages.docid: 4230
negative_passages.text: Time complexity of nested for-loop
negative_passages.docid: 133497
negative_passages.text: Group Membership Test for Permutations
negative_passages.docid: 69589
negative_passages.text: Testing random variate generation algorithms
negative_passages.docid: 97055
negative_passages.text: Sorting algorithm, such that each element is compared $O(\log n)$ times, and doesn't depend on a sorting network
negative_passages.docid: 3420
negative_passages.text: Uniqueness of Extended Euclidean Algorithm
negative_passages.docid: 40994
negative_passages.text: How to check that a cubic polynomial is irreducible?