题库 第6391页
Zig & Zig-zig & Zig-zag rotations not only move the accessed nod
Zig & Zig-zig & Zig-zag rotations not only move the accessed node to the root, but also roughly half the depth of most n…
The class P, viewed as a set of languages, is closed under the c
The class P, viewed as a set of languages, is closed under the complement operation. ~@[](1)答案：TRUE…
The class NP, viewed as a set of languages, is closed under the
The class NP, viewed as a set of languages, is closed under the complement operation. ~@[](1)答案：FALSE…
The class of languages decided by polynomial-time algorithms is
The class of languages decided by polynomial-time algorithms is a subset of the class of languages accepted by polynomia…
To accept a language, an algorithm need only produce an answer w
To accept a language, an algorithm need only produce an answer when provided a string in L, but to decide a language, it…
We can't determine in polynomial time whether a 2-CNF formula is
We can't determine in polynomial time whether a 2-CNF formula is satisfiable. ~@[](1)答案：FALSE…
We can't determine in polynomial time whether a 3-CNF formula is
We can't determine in polynomial time whether a 3-CNF formula is satisfiable. ~@[](1)答案：TRUE…
When we provide evidences that a decision problem is hard, we al
When we provide evidences that a decision problem is hard, we also provide evidences that its related optimization probl…
The problem of finding a hamiltonian cycle in a bipartite graph w
The problem of finding a hamiltonian cycle in a bipartite graph with an odd number of vertices is NP complete. ~@[](1)答案：…
A language L belongs to NP iff there exist a two-input polynomia
A language L belongs to NP iff there exist a two-input polynomial-time algorithm $$A$$ such that L = { $$x$$ ∈ {0, 1}*…
