tashima-tarsh/algorithms-researcher
v1.0.0MIT
Reasons from separating problem, model, and cost model (comparison, word-RAM, arithmetic, online) through exchange/matroid greedy proofs, subproblem-DAG dynamic programming, max-flow min-cut and Goemans–Williamson primal-dual rounding, Karp–Rabin fingerprinting, competitive ratio and Yao's principle, PTAS/FPTAS (Williamson–Shmoys), and Instance Space Analysis over DIMACS10/MIPLIB 2017/SuiteSparse while treating amortized-versus-average-case conflation, unproven greedy killed by a 4-node counterexample, Monte Carlo without a false-match probability, DIMACS10 suite overfitting, and 'linear time' hiding word-size tricks over bit-length L as first-class failure modes.
plugin.json
- name
- algorithms-researcher
- version
- 1.0.0
- description
- Reasons from separating problem, model, and cost model (comparison, word-RAM, arithmetic, online) through exchange/matroid greedy proofs, subproblem-DAG dynamic programming, max-flow min-cut and Goemans–Williamson primal-dual rounding, Karp–Rabin fingerprinting, competitive ratio and Yao's principle, PTAS/FPTAS (Williamson–Shmoys), and Instance Space Analysis over DIMACS10/MIPLIB 2017/SuiteSparse while treating amortized-versus-average-case conflation, unproven greedy killed by a 4-node counterexample, Monte Carlo without a false-match probability, DIMACS10 suite overfitting, and 'linear time' hiding word-size tricks over bit-length L as first-class failure modes.
- author
- K-Densehttps://www.k-dense.ai
- license
- MIT
plugin.json
{
"$schema": "https://agent-plugins.org/schemas/1.0.0/plugin.schema.json",
"name": "algorithms-researcher",
"version": "1.0.0",
"description": "Reasons from separating problem, model, and cost model (comparison, word-RAM, arithmetic, online) through exchange/matroid greedy proofs, subproblem-DAG dynamic programming, max-flow min-cut and Goemans–Williamson primal-dual rounding, Karp–Rabin fingerprinting, competitive ratio and Yao's principle, PTAS/FPTAS (Williamson–Shmoys), and Instance Space Analysis over DIMACS10/MIPLIB 2017/SuiteSparse while treating amortized-versus-average-case conflation, unproven greedy killed by a 4-node counterexample, Monte Carlo without a false-match probability, DIMACS10 suite overfitting, and 'linear time' hiding word-size tricks over bit-length L as first-class failure modes.",
"author": {
"name": "K-Dense",
"url": "https://www.k-dense.ai"
},
"homepage": "https://github.com/K-Dense-AI/scientific-agents",
"repository": "https://github.com/K-Dense-AI/scientific-agents",
"license": "MIT",
"keywords": [
"science",
"agents-md",
"expert-profile",
"algorithms-researcher"
]
}