MFCS
1995
Springer
14 years 4 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
MFCS
1995
Springer
14 years 4 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
MFCS
1995
Springer
14 years 4 months ago
1995
Springer
MFCS
1995
Springer
14 years 4 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
MFCS
1995
Springer
14 years 4 months ago
1995
Springer
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...