Author of the publication

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.

, , and . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)

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.

 

Other publications of authors with the same name

Undecidability of L(F∞) and other lattices of r.e. substructures.. Ann. Pure Appl. Log., (1986)Addendum to "Computably Enumerable Sets and Quasi-Reducibility"., , and . Ann. Pure Appl. Log., 98 (1-3): 295 (1999)Computable Analysis and Classification Problems., and . CiE, volume 12098 of Lecture Notes in Computer Science, page 100-111. Springer, (2020)Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets., , and . Notre Dame J. Formal Log., 60 (3): 491-502 (2019)Infima in the Recursively Enumerable Weak Truth Table Degrees., , and . Notre Dame J. Formal Log., 38 (3): 406-418 (1997)On Supersets of non-low 22_2 Sets., , and . J. Symb. Log., 86 (3): 1282-1292 (2021)Algorithmic randomness., and . Scholarpedia, 2 (10): 2574 (2007)Parameterized Approximation Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 121-129. Springer, (2006)A Note on Decompositions of Recursively Enumerable Subspaces.. Math. Log. Q., 30 (30): 465-470 (1984)The Parameterized Complexity of Sequence Alignment and Consensus., , , and . CPM, volume 807 of Lecture Notes in Computer Science, page 15-30. Springer, (1994)