( en | de | ru )

 

Disambiguation of "Downey, Rodney G."

Author of the publication

copydeleteadd this publication to your clipboard
Fixed Parameter Tractability and Completeness.

, and . Complexity Theory: Current Research, page 191-225. Cambridge University Press, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rodney Fry

Rodney Ast

Rodney Reviere

Rodney King

Rodney Mearns

 

Other publications of authors with the same name

The Complexity of Orbits of Computably Enumerable Sets., , and . Bull. Symb. Log., 14 (1): 69-87 (2008)Computable Analysis and Classification Problems., and . CiE, volume 12098 of Lecture Notes in Computer Science, page 100-111. Springer, (2020)Roman Murawski, Recursive Functions and Metamathematics.. Stud Logica, 70 (2): 297-299 (2002)A Weakly 2-Generic which Bounds a Minimal degree., and . J. Symb. Log., 84 (4): 1326-1347 (2019)Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets., , and . Notre Dame J. Formal Log., 60 (3): 491-502 (2019)Parameterized Approximation Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 121-129. Springer, (2006)Addendum to "Computably Enumerable Sets and Quasi-Reducibility"., , and . Ann. Pure Appl. Log., 98 (1-3): 295 (1999)Tabular Degrees in alpha-Recursion Theory., and . Ann. Pure Appl. Log., 55 (3): 205-236 (1992)Undecidability of L(F∞) and other lattices of r.e. substructures.. Ann. Pure Appl. Log., (1986)Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees., and . Ann. Pure Appl. Log., 61 (3): 195-221 (1993)