Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;M. Anderson,2011
2. Anderson, M., van Melkebeek, D., Schweikardt, N., Segoufin, L.: Locality from circuit lower bounds. To appear in SIAM Journal on Computing (2012)
3. Benedikt, M., Segoufin, L.: Towards a characterization of order-invariant queries over tame structures. Journal on Symbolic Logic 74(1), 168–186 (2009)
4. Courcelle, B.: The Monadic Second-Order Logic of Graphs X: Linear Orderings. Theoretical Computer Science 160(1&2), 87–143
5. Ganzow, T., Rubin, S.: Order-invariant MSO is stronger than Counting MSO in the finite. In: Proc. 25th Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 313–324 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献