Open Access
Computers and Intractability: A Guide to the Theory of NP-Completeness
About:
The article was published on 1999-01-01 and is currently open access. It has received 3564 citations till now. The article focuses on the topics: Completeness (order theory).read more
Citations
More filters
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Journal ArticleDOI
Complex networks: Structure and dynamics
TL;DR: The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.
Journal ArticleDOI
A Tutorial on the Cross-Entropy Method
TL;DR: This tutorial presents the CE methodology, the basic algorithm and its modifications, and discusses applications in combinatorial optimization and machine learning.
DissertationDOI
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
TL;DR: In this paper, the authors introduce a specific class of linear matrix inequalities (LMI) whose optimal solution can be characterized exactly, i.e., the optimal value equals the spectral radius of the operator.
Journal ArticleDOI
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval,Jacques Stern +1 more
TL;DR: It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.