Complexity of Unordered CNF Games
type: Item
instance of: scholarly article
title: Complexity of Unordered CNF Games
zbMATH Open document ID: 1499.68135
DOI: 10.1145/3397478
published in: ACM Transactions on Computation Theory
publication date: 2022-12-05T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 91A44
zbMATH DE Number: 7626554
zbMATH Keywords: CNF
zbMATH Keywords: PSPACE-completeness
zbMATH Keywords: games
zbMATH Keywords: linear time
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/3397478
OpenAlex ID: W3033654061
Recommended article: Q5090999
Recommended article: Unordered Constraint Satisfaction Games
Recommended article: Tractable unordered 3-CNF games
Recommended article: The complexity of constraint satisfaction games and QCSP
Recommended article: The complexity of recursion theoretic games
Recommended article: On The Complexity of Counter Reachability Games*
Recommended article: On the Complexity of Counter Reachability Games
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: On Complexity of Ehrenfeucht-Fraïssé Games
Recommended article: On complexity of Ehrenfeucht-Fraïssé games
description: scientific article; zbMATH DE number 7626554