Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
Title resolution pending
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
Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.
An analog of Cauchy's surface area formula is established for Funk geometry on a convex body K using Holmes-Thompson area and central projections, reducing to a weighted vertex sum for polytopes and yielding a generalized Crofton formula.
citing papers explorer
-
Deterministic Volume Estimation of Truncated Hypercubes
Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
-
Maximally Random Sortition
Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.
-
Cauchy's Surface Area Formula in the Funk Geometry
An analog of Cauchy's surface area formula is established for Funk geometry on a convex body K using Holmes-Thompson area and central projections, reducing to a weighted vertex sum for polytopes and yielding a generalized Crofton formula.