Plankton

Plankton is under development. Join the waitlist

NP-Hard problems in practice

Large instances of NP-hard problems are often solvable under certain conditions, and Plankton knows which ones.

Algorithms at your fingertips

Turn real-world problems into solvable NP-hard cases, achieving fast, reliable, and optimal solutions with minimal effort.

curl https://plankton.systems/api/subset-sum \
     -X POST \
     -H "Authorization: Bearer $token" \
     --json '{ "sum": 20, "numbers": [7, 5, 13, 6, 3, 11, 1, 2] }' 

{"Ok":[7,13]}

API Driven

Our endpoints are designed to allow anyone who can send an HTTP request to solve hard problems.

LLM Support

We use large language models for what they're good at: generating text prompted by human language.

I need to select a set of employees to attend a conference, but no two should have overlapping responsibilities. Can you help me find the optimal group?

It sounds like you are trying to find a group of employees such that no two have overlapping responsibilities. This problem is analogous to finding an Independent Set in a graph where each vertex represents an employee and an edge between any two vertices indicates overlapping responsibilities.

You can use Plankton's Independent set algorithm for this problem. Here's how to map your data to the input format:

  1. Represent each employee as a vertex.
  2. If two employees have overlapping responsibilities, represent this as an edge between their vertices.