608 search results - page 97 / 122 » Tests, Proofs and Refinements |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
JSC
2007
13 years 7 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
ICSE
2010
IEEE-ACM
14 years 16 days ago
2010
IEEE-ACM
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...