A natural NP-complete problem with a nontrivial lower bound
E Grandjean - SIAM Journal on Computing, 1988 - SIAM
Let SAT_<(N) denote the following problem. Instance. A conjunction φ of (in) equalities
t_1=t_2 or t_1<t_2, where t_1, t_2 are terms of the form f_1f_2⋯f_s(e), where e∈N, s\geqq0 …
t_1=t_2 or t_1<t_2, where t_1, t_2 are terms of the form f_1f_2⋯f_s(e), where e∈N, s\geqq0 …
[引用][C] The theory of computability: programs, machines, effectiveness and feasibility
R Sommerhalder, SC Van Westrhenen - (No Title), 1988 - cir.nii.ac.jp
The theory of computability : programs, machines, effectiveness and feasibility | CiNii
Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 …
Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 …