Sciweavers

MFCS
1995
Springer
14 years 2 months ago
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
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...
Wolfgang Merkle, Yongge Wang
MFCS
1995
Springer
14 years 2 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
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...
Osamu Maruyama, Satoru Miyano
MFCS
1995
Springer
14 years 2 months ago
From Timed Automata to Logic - and Back
François Laroussinie, Kim Guldstrand Larsen...
MFCS
1995
Springer
14 years 2 months ago
Measure on P: Robustness of the Notion
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...
Eric Allender, Martin Strauss
MFCS
1995
Springer
14 years 2 months ago
An Abstract Account of Composition
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...
Martín Abadi, Stephan Merz