A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
From MaRDI portal
Publication:2915034
DOI10.1007/978-3-642-32621-9_21zbMath1362.68093OpenAlexW2177135789MaRDI QIDQ2915034
Publication date: 21 September 2012
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32621-9_21
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)
This page was built for publication: A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
