Searching for "Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate" – sorted by Relevance.
Your search – "Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate" – did not match any documents.

