Counting and Addition Cannot Express Deterministic Transitive Closure

An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoint of descriptive complexity theory. TC0 can be characterized as the class of queries expressible by the logic FOC(<,+,

• Type: Conference
• Year: 1999
• Where: LICS
• Authors: Matthias Ruhl
• Keywords: Automated Reasoning, Circuit Complexity Class, Complexity Theory, First-order Logic, LICS 1999