Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
Attributed to:
Descriptive Complexity with Algebraic Operators
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-31585-5_10
Publication URI: http://dx.doi.org/10.1007/978-3-642-31585-5_10
Type: Book Chapter
Book Title: Automata, Languages, and Programming (2012)
Page Reference: 67-78
ISBN: 978-3-642-31584-8
ISSN: 2190-5738