Podcast appearances and mentions of lance fortnow

We are pleased to invite you to a LIVE distinguished YouTube panel discussion on strategic career pathways for emerging scholars in computer science. This session, “Pathways to Success: Job Market Strategies for Ph.D. Students and Postdocs in Computer Science,” on NOVEMBER 10 (Sunday), 11am ET, brings together esteemed leaders to provide insights and guidance on navigating career choices, whether in academia, research labs, or industry.Potential Discussion Topics:____________________________Career Path & Decision-Making: Insights into choosing between academia, industry, and research labs, and the key factors influencing these decisions.Application Process & Preparation: Guidance on creating impactful applications, the role of publications, and tips for writing effective teaching and research statements.Interviewing & Negotiation: Common interview questions, advice on salary and start-up package negotiations, and factors to consider for long-term success.Academia vs. Industry: A comparison of growth opportunities, work-life balance, and career progression across different sectors.Long-Term Success & Networking: Strategies for building professional networks, finding mentors, and initiating collaborations.Our Distinguished Panelists:____________________________Prof. Lance Fortnow, Dean of the College of Computing at the Illinois Institute of Technology, former Dean of Science at IIT, and past Chair of the School of Computer Science at Georgia Tech, renowned for his contributions to computational complexity.Prof. Mohammad Hajiaghayi, Professor at the University of Maryland and Research Scientist at Google, with prior employment at Amazon, Overstock, AT&T, and Microsoft, recognized for his expertise in algorithms and game theory.Dr. Nicole Immorlica, Senior Principal Researcher at Microsoft Research and former faculty member at Northwestern University, celebrated for her pioneering work at the intersection of economics and computation.Prof. Samir Khuller, Peter and Adrienne Barris Chair of Computer Science at Northwestern University, and former Chair of the CS Department at the University of Maryland, College Park, known for his expertise in graph algorithms and discrete optimization.This panel offers a unique opportunity for early-career researchers to gain valuable perspectives on navigating the job market, building successful careers, and making informed decisions that align with their professional goals.Please join us and ask questions online.

In this week's episode, host Kyle Polich interviews author Lance Fortnow about whether P will ever be equal to NP and solve all of life’s problems. Fortnow begins the discussion with the example question: Are there 100 people on Facebook who are all friends with each other? Even if you were an employee of Facebook and had access to all its data, answering this question naively would require checking more possibilities than any computer, now or in the future, could possibly do. The P/NP question asks whether there exists a more clever and faster algorithm that can answer this problem and others like it.

Lance Fortnow, PhD - Author of The Golden Ticket: P, NP, and the Search for the Impossible, professor and chair of the School of Computer Science of the College of Computing at the Georgia Institute of Technology, served as the founding editor-in-chief of the ACM Transaction on Computation Theory, served as chair of ACM SIGACT and currently sits on the Computing Research Association board of directors. He served as chair of the IEEE Conference on Computational Complexity from 2000-2006. It's time to bend your brain and mess with your mind with one of Smart People Podcast's most intellectual and in-depth interviews EVER! Did you know that there is a problem known as the "P versus NP problem" that, if solved, could cure cancer, predict the weather, rid us over poverty, and pretty much change the entirety of our world? Our guest this week goes so far as to say, "What we would gain from P = NP will make the whole Internet look like a footnote in history!" But there is one pretty big problem. We have had the best and brightest people in the world (including this week's guest) working on this problem for decades and they still can't even decide IF it can be solved! Due to the complexity and positive implications that a solution would have on our society, the "P versus NP problem" is one of the seven Millennium Problems for which the Clay Mathematics Institute will give you one million dollars if you can prove it. We are going to leave the heavy lifting to Lance, but as a primer, P versus NP basically states that if these two variables are equal, we would be able to solve every complex issue with a very simple equation.  Oh, you want more than that? Ok fine.  P stands for "Polynomial Time" and represents the entire class of problems with efficient solutions. NP stands for "Nondeterministic Polynomial-Time" and represents the entire class of the very hardest, most difficult problems. Therefore if the 2 were equal, we would be able to apply this algorithm to all of our most difficult, complex problems and come up with a simple solution. Believe us, even those that aren't math or computer savvy will love to hear the way that Lance breaks down such a complicated idea into a real life scenario. Imagine the possibilities if P = NP! (I never thought I would write that in my life) Lance Fortnow is professor and chair of the School of Computer Science of the College of Computing at the Georgia Institute of Technology. His research focuses on computational complexity and its applications to economic theory. Fortnow received his Ph.D. in Applied Mathematics at MIT in 1989 under the supervision of Michael Sipser. Before he joined Georgia Tech in 2012, Fortnow was a professor at Northwestern University, the University of Chicago, a senior research scientist at the NEC Research Institute and a one-year visitor at CWI and the University of Amsterdam. Since 2007, Fortnow holds an adjoint professorship at the Toyota Technological Institute at Chicago. Fortnow's research spans computational complexity and its applications, most recently to micro-economic theory. Fortnow's survey The Status of the P versus NP Problem is CACM's most downloaded article. Fortnow has written a popular science book The Golden Ticket: P, NP and the Search for the Impossible loosely based on that article.  

Lance Fortnow wrote a great book about the P/NP problem for a general audience. We discuss the problem, its importance, its interest to Lance, how difficult it is to solve, what some of the difficult problems are, and a bunch more.

Today we’ll be discussing Lance Fortnow‘s bookThe Golden Ticket:P, NP, and the Search for the Impossible (Princeton University Press, 2013).The book focuses on the challenges associated with solving problems requiring significant computation, such as “What is the largest group of Facebook users, all of whom know each other?”If it is shown that all computational problems can be solved relatively easily (this is known as showing that P=NP), then such problems as finding a cure for cancer and other diseases would be much more easily solved. Listen in and find out how. Learn more about your ad choices. Visit megaphone.fm/adchoices

Today we’ll be discussing Lance Fortnow‘s bookThe Golden Ticket:P, NP, and the Search for the Impossible (Princeton University Press, 2013).The book focuses on the challenges associated with solving problems requiring significant computation, such as “What is the largest group of Facebook users, all of whom know each other?”If it is shown that all computational problems can be solved relatively easily (this is known as showing that P=NP), then such problems as finding a cure for cancer and other diseases would be much more easily solved. Listen in and find out how. Learn more about your ad choices. Visit megaphone.fm/adchoices

Today we’ll be discussing Lance Fortnow‘s bookThe Golden Ticket:P, NP, and the Search for the Impossible (Princeton University Press, 2013).The book focuses on the challenges associated with solving problems requiring significant computation, such as “What is the largest group of Facebook users, all of whom know each other?”If it is...