scientific article; zbMATH DE number 7278108
From MaRDI portal
Publication:5136328
DOI10.4230/LIPIcs.FSTTCS.2017.36zbMath1485.68112MaRDI QIDQ5136328
Michael Ludwig, Nutan Limaye, Andreas Krebs
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Applications of universal algebra in computer science (08A70)
Related Items (1)
Cites Work
- On uniform circuit complexity
- \(k\)-NLC graphs and polynomial algorithms
- Balancing bounded treewidth circuits
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- Constructing small tree grammars and small circuits for formulas
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Complexity of Regular Functions
- Arithmetic Circuits: A Chasm at Depth 3
- Cost Register Automata for Nested Words
- Parity, circuits, and the polynomial-time hierarchy
- Counting Paths in VPA Is Complete for #NC 1
- The Polynomially Bounded Perfect Matching Problem Is in NC 2
- An Optimal Parallel Algorithm for Formula Evaluation
- Log Space Recognition and Translation of Parenthesis Languages
- The Parallel Evaluation of General Arithmetic Expressions
- On the Correlation of Parity and Small-Depth Circuits
- Counting Euler Tours in Undirected Bounded Treewidth Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
