ISTA Publications
metadata only
Fully dynamic approximate minimum cut in subpolynomial time per operation
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximation Schemes for Preemptive Weighted Flow Time#648105
- Mixed precision solvers for the all-at-once Runge--Kutta discretization of the heat equation#1122855
- Optimal Intermediate Hamiltonians for Non-Equilibrium Free Energy Calculations: A Numerical Study of Markov Models#997391
- Work as a function of protocol duration for the efficient erasure of an underdamped memory: isothermal to adiabatic transition#999002
- Dynamic and Optimal Function Inversion in the Small-Time Regime#1034008
Record · ID 433563
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive