13 search results - page 2 / 3 » Error-bounded probabilistic computations between MA and AM |
BIRTHDAY
2010
Springer
14 years 5 days ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
SIAMSC
2008
13 years 7 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
EUC
2008
Springer
13 years 9 months ago
2008
Springer
Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflictin...
FOCS
2003
IEEE
14 years 20 days ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
SIAMCOMP
1998
13 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...