sentence1: although finding a minimum size oct set is np-hard , the problem of deciding if an oct set with size k exists is fixed parameter tractable with algorithms in running in times oand o , respectively .
sentence2: although finding a minimum size oct set is np-hard , the problem of deciding if an oct set with size k exists is fixed parameter tractable , with algorithms in running in times oand o , respectively .