Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers

DOI10.1007/978-3-642-31585-5_10zbMath1287.03081OpenAlexW289173989WikidataQ58215497 ScholiaQ58215497MaRDI QIDQ3167000

Anuj Dawar, Albert Atserias

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/26697

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Model theory of finite structures (03C13)

This page was built for publication: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers