Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Concept

Machine epsilon

Formal sciences
Mathematics
Analysis
Numerical analysis

About
Privacy
Disclaimer

Graph Chatbot

Related publications (23)

Page 2 of 2

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...

Ieee2012

Certifying Solutions for Numerical Constraints

Viktor Kuncak, Eva Darulova

A large portion of software is used for numerical computation in mathematics, physics and engineering. Among the aspects that make verification in this domain difficult is the need to quantify numerical errors, such as roundoff errors and errors due to the ...

2013

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

János Pach

It is an old problem of Danzer and Rogers to decide whether it is possible arrange O(1/epsilon) points in the unit square so that every rectangle of area epsilon contains at least one of them. We show that the answer to this question is in the negative if ...

Springer-Verlag Berlin2011