A. Manaster and J. Rosenstein, "Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)", Proc. London Math. Soc. 3 (1972), 615-- 654.  Home/Search   Document Not in Database   Summary   Related Articles

....version of this paper appeared in Proc. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775, Springer Verlag, 1994, pp. 633 645. Incumbent of the William Sussman Chair of Mathematics. papers were written in the 1970s by Manaster and Rosenstein [MR] and Bean [B1, B2] Following that, a variety of problems were considered, including ones that are NP complete for finite graphs, such as k colorability and Hamiltonicity [B1, B2, BG2, Bu, GL, MR] and ones that are in P in the finite case, such as Eulerian paths [B2, BG1] In most cases (including ....

.... Incumbent of the William Sussman Chair of Mathematics. papers were written in the 1970s by Manaster and Rosenstein [MR] and Bean [B1, B2] Following that, a variety of problems were considered, including ones that are NP complete for finite graphs, such as k colorability and Hamiltonicity [B1, B2, BG2, Bu, GL, MR] and ones that are in P in the finite case, such as Eulerian paths [B2, BG1] In most cases (including the above examples) the problems turned out to be undecidable. This is true even for highly recursive graphs [B1] i.e. ones for which node degree is finite and the set of neighbors of a node is ....

A. Manaster and J. Rosenstein, "Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)", Proc. London Math. Soc. 3 (1972), 615-- 654.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC