Sciweavers

2752 search results - page 72 / 551
» Rounding to an Integral Program
Sort
View
SAC
2006
ACM
14 years 2 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 2 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
COMPGEOM
1996
ACM
14 years 28 days ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk
CRYPTO
1991
Springer
144views Cryptology» more  CRYPTO 1991»
14 years 9 days ago
Interactive Proofs with Space Bounded Provers
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
Joe Kilian, Ronitt Rubinfeld
DAGSTUHL
2007
13 years 10 months ago
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner