๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem

โœ Scribed by Shamir, A.

Book ID
114635432
Publisher
IEEE
Year
1984
Tongue
English
Weight
951 KB
Volume
30
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
โœ Jay Sethuraman; Chung-Piaw Teo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A polynomial time algorithm for the N-Qu
A polynomial time algorithm for the N-Queens problem
โœ Sosic, Rok; Gu, Jun ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Association for Computing Machinery โš– 405 KB

The __n__ -queens problem is a classical combinatorial problem in the artificial intelligence (AI) area. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving strategies. Recently, this problem has found prac