On NP-complete search problems on finite algebras

被引：0
|
作者：
Rossi, Bernardo [1 ,2 ]
Aichinger, Erhard [2 ]
机构：
[1] Charles Univ Prague, Prague, Czech Republic
[2] Johannes Kepler Univ Linz, Linz, Austria
来源：
2024 IEEE 54TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, ISMVL 2024 | 2024年
基金：
奥地利科学基金会;
关键词：
Polynomial satisfiability; congruence modular varieties; SERF-reductions; ETH; EQUATION SOLVABILITY;
D O I：
10.1109/ISMVL60454.2024.00034
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate under which structural assumptions on a finite algebra A the problem 3SAT with complexity measure the number of clauses can be reduced to POLSAT(A) in logarithmic space and with a linear growth of the problem size. Our results imply that under the exponential time hypothesis, no two-element algebra of tame congruence theory type 3 has a sub-exponential algorithm to solve a single polynomial equation.
引用
收藏
页码：131 / 136
页数：6
相关论文
共 50 条
12345