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 条
  • [21] MARTINGALE INEQUALITIES AND NP-COMPLETE PROBLEMS
    RHEE, WT
    TALAGRAND, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) : 177 - 181
  • [22] Neural networks for NP-complete problems
    Budinich, M
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1997, 30 (03) : 1617 - 1624
  • [23] On Some NP-complete SEFE Problems
    Angelini, Patrizio
    Da Lozzo, Giordano
    Neuwirth, Daniel
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 200 - 212
  • [24] Generic complexity of NP-complete problems
    GROUP-BASED CRYPTOGRAPHY, 2008, : 129 - 134
  • [25] INFEASIBLE COMPUTATION - NP-COMPLETE PROBLEMS
    LAMAGNA, EA
    ABACUS-NEW YORK, 1987, 4 (03): : 18 - 33
  • [26] OPTP AS THE NORMAL BEHAVIOR OF NP-COMPLETE PROBLEMS
    GASARCH, WI
    KRENTEL, MW
    RAPPOPORT, KJ
    MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 487 - 514
  • [27] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 172 - 186
  • [28] ON CHAOTIC BEHAVIOR OF SOME NP-COMPLETE PROBLEMS
    PERL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 149 - 161
  • [29] SAT Oracles, for NP-Complete Problems and Beyond
    Le Berre, Daniel
    SPLC'19: PROCEEDINGS OF THE 23RD INTERNATIONAL SYSTEMS AND SOFTWARE PRODUCT LINE CONFERENCE, VOL A, 2020, : XXII - XXII
  • [30] NP-COMPLETE DECISION PROBLEMS FOR BINARY QUADRATICS
    MANDERS, KL
    ADLEMAN, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (02) : 168 - 184
12345