Author:
Rahman Md Lutfar,Watson Thomas
Publisher
Springer International Publishing
Reference12 articles.
1. Lecture Notes in Computer Science;L Ahlroth,2012
2. Aspvall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
3. Byskov, J.: Maker-maker and maker-breaker games are PSPACE-complete. Technical report RS-04-14, BRICS, Department of Computer Science, Aarhus University (2004)
4. Calabro, C.: 2-TQBF is in P (2008). https://cseweb.ucsd.edu/~ccalabro/essays/complexity_of_2tqbf.pdf. Unpublished
5. Kutz, M.: The angel problem, positional games, and digraph roots. Ph.D. thesis, Freie Universität Berlin (2004). Chapter 2: Weak Positional Games
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献