Towards a more efficient approach for the satisfiability of two-variable logic

We revisit the satisfiability problem for two-variable logic, denoted by SAT(FO 2 ), which is known to be NEXP-complete. The upper bound is usually derived from its well known exponential size model property. Whether it can be determinized/randomized efficiently is still an open question.In this pap...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori:	Lin, Ting-Wei, Lu, Chia-Hsuan, Tan, Tony
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Complexity theory Computer science Time complexity Upper bound
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!