Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows-Reference-Cited by-同舟云学术

Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows

Author:

Marin Paolo¹,Narizzano Massimo²,Pulina Luca³,Tacchella Armando⁴,Giunchiglia Enrico⁵

Affiliation:

1. Lehrstuhl für Rechnerarchitektur Georges-Köhler-Allee 051 79110 Freiburg i.B., Germany marin@informatik.uni-freiburg.de

2. DIBRIS, Università degli Studi di Genova Via Opera Pia 13, 16145 Genova, Italy massimo.narizzano@unige.it

3. POLCOMING, Università degli Studi di Sassari Viale Mancini 5, 07100 Sassari, Italy lpulina@uniss.it

4. DIBRIS, Università degli Studi di Genova Via Opera Pia 13, 16145 Genova, Italy armando.tacchella@unige.it

5. DIBRIS, Università degli Studi di Genova Via Opera Pia 13, 16145 Genova, Italy enrico.giunchiglia@unige.it

Publisher

IOS Press

Subject

Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. International Competition on Graph Counting Algorithms 2023;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-09-01

2. Dynamics of Bipartite Logical Networks;2024 47th MIPRO ICT and Electronics Convention (MIPRO);2024-05-20