Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
Michael Hayter edited this pageApr 16, 2025 ·3 revisions
  • Classic dynamic programming articles (LIS,LCS,Subset sum, etc.) listed in intro_to_dp.md

  • Schreier–Sims algorithm

  • Berlekamp-Massey algorithmJi Driver tree (?)

  • Enumerating points in non-lattice polygons (generalization of Pick's theorem)

  • DP on convex subsets

  • DP optimizations (list?)

  • Generating functions and calculating functions of polynomials

Clone this wiki locally

[8]ページ先頭

©2009-2025 Movatter.jp