arXiv (All)
open access
Systematic Data Structure Lower Bounds via the Query-with-Sketch Model
We study data structure lower bounds for the Approximate Matrix Powering (AMP) problem. Given a substochastic, symmetric matrix $\mathbf{M}\in\mathbb{R}^{n\times n}$ and parameters $k$ and $α$, the goal is to preprocess $\mathbf{M}$ so as to answer entry queries $(u,v)\mapsto \mathbf{M}^{k}[u,v]$ up
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
- A Polynomial-Time Strict-Sub-One-Third Approximation Theorem for Bimatrix Games#1119836
- Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra#996996
- An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph#1062749
- An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs#189200
- Pathwidth-One Vertex Explosion and Co-Path Problems#1115918
Record · ID 1011731
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