50 search results - page 9 / 10 » Proof Verification and Hardness of Approximation Problems |
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
WINE
2010
Springer
13 years 3 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
CTRSA
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
ICFEM
2009
Springer
13 years 12 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...