Computer Science Logic
From MaRDI portal
Publication:5292646
DOI10.1007/b13224zbMath1116.68474OpenAlexW2623947920MaRDI QIDQ5292646
Jonathan Panttaja, Phokion G. Kolaitis
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Combinatorial games (91A46) Other infinitary logic (03C75)
Related Items
Regularizing conjunctive features for classification, On the speed of constraint propagation and the time complexity of arc consistency testing, A More General Theory of Static Approximations for Conjunctive Queries, On complexity of Ehrenfeucht-Fraïssé games, A more general theory of static approximations for conjunctive queries, A Logical Approach to Constraint Satisfaction
