Sciweavers

1650 search results - page 41 / 330
» The HOM problem is decidable
Sort
View
WOLLIC
2010
Springer
14 years 22 days ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
JCO
2008
76views more  JCO 2008»
13 years 7 months ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...
EOR
2007
87views more  EOR 2007»
13 years 7 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
IJAC
2007
59views more  IJAC 2007»
13 years 7 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu
ACTAC
2002
90views more  ACTAC 2002»
13 years 7 months ago
The Home Marking Problem and Some Related Concepts
: In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home m...
Roxana Melinte, Olivia Oanea, Ioana Olga, Ferucio ...