Lehigh University Master in Financial Engineering的动态

Some win sooner and some are late, let's not be a part of the rat race, as it is fake. Finishing the task is important that the speed of it. Rabbit has his own speed and do does tortoise. The motivation should be to reach the finish line with the best efforts you can. My recent article also discusses about the similar problem of unsaid competition we all live in and judge who are slower. Read it by clicking on the link. https://lnkd.in/dn5TcyPf

Hello! ?? In my most recent video I use a rope analogy to describe pi and the formula for the circumference of a circle. This video is accessible to anyone with or without knowing much about maths, so I recommend watching! ?? I feel like my confidence has already gotten much better, and the video is overall better quality than my last. It was made as a submission to a competition so I hope to gain critical feedback from the judges.??? ?? Learn about the competition: https://some.3b1b.co/ ?? WATCH THE VID: https://lnkd.in/eXdmPKtc

Prof Subbarao Kambhampati talks will help you understand the capabilities and hype around LLMs. Every time you watch it, you'll understand 20% more. So watch it 5 times. https://lnkd.in/gcDUaPz7

And finally the method has been presented…

Practical notes on the FRI low degree test:

In this weeks video I explain how the Matrix class works. A link to the source code is provided in the video's description.

As part of our ongoing endeavor to transition my courses online, we are continuing lectures for the Algorithmic Lower Bound Course. Lesson 18: Algorithmic Lower Bounds by Mohammad Hajiaghayi: Approximability and Inapproximability https://lnkd.in/efuwk8Ea Lesson 19: Algorithmic Lower Bounds by Mohammad Hajiaghayi: PCP Theorem for Approximation Hardness 1 (guest lecturer Prof. Bill Gasarch) https://lnkd.in/eKMSJN3Z Lesson 20: Algorithmic Lower Bounds by Mohammad Hajiaghayi: PCP Theorem for Approximation Hardness 2 (guest lecturer Prof. Bill Gasarch) https://lnkd.in/eYsbe44H Lectures 18, 19, and 20 delve into topics related to approximability and inapproximability, focusing on problems like label cover, set cover, max rep, and min rep. Lecture 18 introduces approximation algorithms and fixed-parameter algorithms, emphasizing their practicality for problems with small parameters. Lecture 19 and 20, led by guest lecturer Prof. Bill Gasarch, explore the PCP theorem for approximation hardness. The discussion covers the role of the PCP theorem in proving lower bounds on approximation and its implications for problems like Unique game and the traveling salesman problem. Despite clarifying that the PCP theorem doesn't directly imply P=NP, the lectures underscore the challenges in approximating problems like three-dimensional matching and TSP, ultimately highlighting the difficulty in achieving arbitrary levels of approximation for certain NP-hard problems. Feel free to subscribe to our YouTube channel @hajiaghayi for upcoming lessons premiering every Wednesday at 7pm ET (you can access all the lectures for the Algorithmic Lower Bound course, including future sessions, in the following playlist: https://lnkd.in/eSZt5Cy9 Additionally, all lectures on Introduction to Algorithms are available in this playlist: https://lnkd.in/eg6MpJWz) #ApproximationAlgorithms, #PCPTheorem, #P=NP, #Hardness, #JigsawPuzzle, #TSP, #Max3SAT, #MathematicalChallenges, #AlgorithmDesign, #ComputationalComplexity, #TheoreticalComputerScience, #AlgorithmicLowerBounds

Day 22/30 A lot of learning with this problem today. Understood the concept of top-down and bottom-up approach better with this one. Longest common subsequence was the problem that I solved with top-down approach where I was using memoization. For longest common substring I used bottom-up approach. #geekstreak2024 Time Complexity: O(len(str1)*len(str2)) Space Complexity: O(len(str1)*len(str2))

I have completed this short course.

Did you miss Rich Zwelling's FREE LiveTeach class on Quant Statistics, Verbal Text Completion and Sentence Equivalence Questions? Don't worry, as you can still benefit from Rich's experience and expertise in cracking the #GRE! In this session, Rich shared essential habits and tactics to increase your GRE score dramatically. Don't let a missed opportunity hold you back from achieving your GRE goals. ?? Watch the video here: https://ow.ly/Zt9K50Q8uLI #GREPrep #GREQuant #GREVerbal #GRETips #GREStrategies #TargetTestPrep #TTP #PrepareWithTheBestRockTheTest