Results 231 to 239 of about 4,855,672 (239)

Complexity of nondeterministic algorithms for frontally bounded problems

Summary: Frontwidth constraints on problems: 3-SAT, Hamiltonian circuit and pebble are considered. We show that 3-SAT, when restricted to \(n\)-clause collections of frontwidth \(f(n)\), is in the complexity class \(\text{NTISP(poly}, f(n))\); Hamiltonian circuit for \(n\)-vertex graphs of frontwidth \(f(n)\) is in the class \(\text{NTISP(poly}, f(n ...
openaire   +1 more source

Home - About - Disclaimer - Privacy