Comparing Universal Covers in Polynomial Time.

Jirí Fiala Daniël Paulusma

Published in: CSR (2008)

Keyphrases

special case
computational complexity
turing machine
artificial intelligence
approximation algorithms
databases
scheduling problem
search engine
information systems
search algorithm