Algorithm Search⌘K

Theoremresearch

NP-hardness of pseudoknot prediction

Also called Pseudoknot prediction is NP-hard.

Predicting the minimum free energy structure with arbitrary pseudoknots is NP-hard (Lyngso and Pedersen, 2000).

Predicting the minimum free energy structure with arbitrary pseudoknots is NP-hard (Lyngso and Pedersen, 2000).

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Statement
  • one source with a locator