CCA does not compose autoregressively and retrofitting requires exponential query complexity under weak optimality.
18th Annual Symposium on Foundations of Computer Science (sfcs 1977) , pages=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.
A queueing model derives stability conditions for LLM inference services under combined compute and KV cache memory limits, with experimental validation showing typical deviations under 10%.
citing papers explorer
-
Barriers to Counterfactual Credit Attribution for Autoregressive Models
CCA does not compose autoregressively and retrofitting requires exponential query complexity under weak optimality.
-
Matroid Algorithms Under Size-Sensitive Independence Oracles
In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.
-
A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints
A queueing model derives stability conditions for LLM inference services under combined compute and KV cache memory limits, with experimental validation showing typical deviations under 10%.