answersLogoWhite

0

All the optimization problems in Computer Science have a predecessor analogue in continuous domain and they are generally expressed in the form of either functional differential equation or partial differential equation. A classic example is the Hamiltonian Jacobi Bellman equation which is the precursor of Bellman Ford algorithm in CS.

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin

Add your answer:

Earn +20 pts
Q: What are the applications of partial differential equations in computer science?
Write your answer...
Submit
Still have questions?
magnify glass
imp