Author:
Grandjean Etienne,Olive Frédéric
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. J.R. BÜCHI, Weak second order arithmetic and finite automata, Z.Math. Logik Grundlagen Math. 6 (1960), pp.66–92.
2. R.FAGIN, Generalised first-order spectra and polynomial-time recognizable sets, in Complexity of Computations, R.Karp, ed., SIAM-AMS Proc. 7, 1974, pp.43–73.
3. E.GRÄDEL, On the notion of linear time computability, International J. of Foundations of Computer Science, No 1 (1990), pp.295–307.
4. E.GRANDJEAN, A natural NP-complete problem with a nontrivial lower bound, SIAM J.Comput., 17 (1988), pp.786–809.
5. E.GRANDJEAN, A nontrivial lower bound for an NP problem on automata, SIAM J. Comput., 19 (1990), pp.438–451.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献