165 search results - page 30 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
89
Voted
NCA
2006
IEEE
15 years 5 months ago
2006
IEEE
Geant4 is a very large, highly accurate toolkit for Monte Carlo simulation of particle-matter interaction. It has been applied to high-energy physics, cosmic ray modeling, radiati...
98
Voted
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
87
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
91
Voted
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...