On the Approximability of Comparing Genomes with Duplicates

Accordingly, for Chalmers the psychophysical laws that would be involved in the nomological supervenience of consciousness relate something physical with something that is

A note on the hardness results for the labeled perfect matching problems in bipartite graphs..

As described in Section II-B, we consider three scenarios: (i) at least two IBPs engaged in a Bertrand competition and leading the transit price to zero, (ii) a monopolist IBP

Finally, for the first time, we compare a collec- tion of novels and a collection of fairy tales using an emotion lexicon to show that fairy tales have a much wider distribution

The question used in the Bureau of Criminal Justice Statistics’ 2001 survey of cybercrime against businesses, for example, asked about the following categories of

On the positive side, variants of the greedy approach have been used in order to compute maximum matchings in quasi linear-time on some graph classes that admit a

We illustrate in this section the valuation of the European call option on the maximum of the instantaneous rate in the one factor affine mode bu using its explicite formula of