Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.

Arfst Nickelsen Till Tantau

Published in: FCT (2001)

Keyphrases

partial information
incomplete information
computational complexity
special case
approximation algorithms
worst case
positive data
bounded degree
tree languages
optimal solution
dynamic environments
orders of magnitude
dnf formulas