Outer Web | Explore

Explore >> Select a destination

You are here		blog.paulhankin.net A novel and efficient way to compute Fibonacci numbers
\|	\|	www.haskellforall.com Haskell for all: Blazing fast Fibonacci numbers using Monoids	4.1 parsecs away Travel
\|	\|	fibonacci This post illustrates a nifty application of Haskell's standard library to solve a numeric problem. The Fi...	4.1 parsecs away Travel
\|	\|	raganwald.com An ES6 function to compute the nth Fibonacci number	1.9 parsecs away Travel
\|	\|		1.9 parsecs away Travel
\|	\|	jeremykun.com Sample Extraction from RLWE to LWE - Math ? Programming	3.9 parsecs away Travel
\|	\|	In this article I'll derive a trick used in FHE called sample extraction. In brief, it allows one to partially convert a ciphertext in the Ring Learning With Errors (RLWE) scheme to the Learning With Errors (LWE) scheme. Here are some other articles I've written about other FHE building blocks, though they are not prerequisites...	3.9 parsecs away Travel
\|	\|	dougseven.com Why write all your code yourself? - Doug Seven	32.3 parsecs away Travel
\|		Today I am at re:Invent 2022 in Las Vegas, NV. I am spending my days talking to AWS customers about Amazon CodeWhisperer - a new developer productivity service that will accelerate application development by providing automatic code recommendations based on the code and comments in your IDE. For developers, Amazon CodeWhisperer is an IDE extension...	32.3 parsecs away Travel