On the Descriptive Complexity of Linear Algebra
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Choiceless Polynomial Time, Counting and the Cai--Fürer--Immerman Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
| Hi-index | 0.00 |