Enumeration Complexity of Logical Query Problems with Second-order Variables
From MaRDI portal
Publication:2915682
DOI10.4230/LIPIcs.CSL.2011.189zbMath1247.68073OpenAlexW2240520130MaRDI QIDQ2915682
Publication date: 18 September 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_ee39.html
Database theory (68P15) Complexity of computation (including implicit computational complexity) (03D15) Descriptive complexity and finite models (68Q19)
Related Items
Unnamed Item ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ Unnamed Item ⋮ An Experimental Study of the Treewidth of Real-World Graph Data