Publisher
Springer Berlin Heidelberg
Reference53 articles.
1. Ajtai, M.: Σ1 1 formulae on finite structures. Ann. of Pure and Applied Logic 24, 1–48 (1983)
2. Ajtai, M., Fagin, R.: Reachability is harder for directed than for undirected nite graphs. Journal of Symbolic Logic 55(1), 113–150 (1990)
3. Ajtai, M., Fagin, R., Stockmeyer, L.: The closure of monadic NP. IBM Research Report RJ 10092 (1997)
4. Arora, S., Fagin, R.: On winning strategies in Ehrenfeucht-Fraïssé games. Theoretical Computer Science 174(1-2), 97–121 (1997)
5. Baker, T., Gill, J., Solovay, R.: Relativizations of the P =? NP question. SIAM Journal on Computing 4(4), 431–442 (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献