For Erdős-Rényi random graphs the d-dimensional realization count is infinity or 2^k with k polynomial-time computable; analogous result for generic PSD matrix completion.
Gcontains ak-connectedk- core containing at least5n/9vertices
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A two-level low-rank approximation enables scalable A-optimal sensor design for passive imaging without repeated PDE solves in the online phase.
Coverage tests for simulation-based inference of f_NL can pass while the posteriors are underconfident in the tails and sometimes yield weaker constraints than using power spectrum or bispectrum alone.
citing papers explorer
No citing papers match the current filters.