𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Inferring a sequence generated by a linear congruence

✍ Scribed by Plumstead, Joan B.; Plumstead, Joan B.; Plumstead, Joan B.; Plumstead, Joan B.

Book ID: 115495061
Publisher: IEEE
Year: 1982
Weight: 795 KB
Volume: 0
Category: Article
DOI: 10.1109/sfcs.1982.73

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Three applications of Kolmogorov-complexity

✍ Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Schnitger, Georg 📂 Article 📅 1982 🏛 IEEE ⚖ 577 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Probabilistic analysis of some bin-packing problems

✍ Karmarkar, Narendra; Karmarkar, Narendra; Karmarkar, Narendra; Karmarkar, Narend 📂 Article 📅 1982 🏛 IEEE ⚖ 494 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem

✍ Shamir, Adi; Shamir, Adi; Shamir, Adi; Shamir, Adi 📂 Article 📅 1982 🏛 IEEE ⚖ 805 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - A polynomial-time reduction from bivariate to univariate integral polynomial factorization

✍ Kaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich 📂 Article 📅 1982 🏛 IEEE ⚖ 743 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - On the program size of perfect and universal hash functions

✍ Mehlhorn, Kurt; Mehlhorn, Kurt; Mehlhorn, Kurt; Mehlhorn, Kurt 📂 Article 📅 1982 🏛 IEEE ⚖ 543 KB

[IEEE 2012 IEEE 53rd Annual Symposium on

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers

✍ Ito, Tsuyoshi; Vidick, Thomas 📂 Article 📅 2012 🏛 IEEE ⚖ 217 KB