|
Search the dblp DataBase
Bernard R. Hodgson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bernard R. Hodgson, Clement F. Kent
A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP] CTRS, 1990, pp:137-142 [Conf]
- Bernard R. Hodgson, Clement F. Kent
A Normal Form for Arithmetical Representation of NP-Sets. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1983, v:27, n:3, pp:378-388 [Journal]
- Bernard R. Hodgson, Clement F. Kent
Uniform Normal Form for General Time-Bounded Complexity Classes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1986, v:32, n:3, pp:363-369 [Journal]
- William S. Hatcher, Bernard R. Hodgson
Complexity Bounds on Proofs. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1981, v:46, n:2, pp:255-258 [Journal]
- Clement F. Kent, Bernard R. Hodgson
Extensions of Arithmetic For Proving Termination of Computations. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1989, v:54, n:3, pp:779-794 [Journal]
- Bernard R. Hodgson
On Direct Products of Automaton Decidable Theories. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:19, n:, pp:331-335 [Journal]
- Clement F. Kent, Bernard R. Hodgson
An Arithmetical Characterization of NP. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:21, n:, pp:255-267 [Journal]
Search in 0.001secs, Finished in 0.001secs
|