# Search results

Information Processing Letters > 2015 > 115 > 6-8 > 609-611

_{1}

^{0}-complete. Surprisingly, it turns out that the infinite Post Correspondence Problem is not ''more complex'' than the Post Correspondence Problem, which is known to be Σ

_{1}

^{0}-complete, but has the exact dual complexity. This gives an answer to a question of...

European Journal of Operational Research > 2015 > 242 > 3 > 960-974

Journal of Computer and System Sciences > 2015 > 81 > 2 > 473-484

Artificial Intelligence > 2015 > 220 > Complete > 64-103

Theoretical Computer Science > 2015 > 565 > Complete > 102-112

Artificial Intelligence > 2015 > 218 > Complete > 56-73

Information Processing Letters > 2014 > 114 > 11 > 585-590

Artificial Intelligence > 2014 > 215 > Complete > 79-119

IEEE Antennas and Propagation Society Symposium, 2004. > 2 > 1191 - 1194 Vol.2

Concurrency and Computation: Practice and Experience > 34 > 16 > n/a - n/a

Bulletin of the Section of Logic > 2022 > 51 > 2 > 197-205

International Journal of Communication Systems > 34 > 17 > n/a - n/a

Statistical Analysis and Data Mining: The ASA Data Science Journal > 14 > 5 > 501 - 515

Fundamenta Informaticae > 2021 > Vol. 180, nr 1-2 > 1--28

International Journal of Communication Systems > 34 > 8 > n/a - n/a

*G*. Potentially a fire (or other type of contagion) might erupt at some vertex of

*G*. We are able to respond to this outbreak by establishing a firebreak at

*k*other vertices of

*G*, so that the fire cannot pass through these fortified vertices. The question that now arises is which

*k*vertices will result in the greatest number of vertices being...