Sciweavers

43 search results - page 5 / 9
» Elementary arithmetic
Sort
View
APAL
2010
115views more  APAL 2010»
13 years 7 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
ANTS
2004
Springer
105views Algorithms» more  ANTS 2004»
14 years 24 days ago
Algorithmic Aspects of Cubic Function Fields
Abstract. This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rati...
Renate Scheidler
CIE
2006
Springer
13 years 11 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
UC
2010
Springer
13 years 5 months ago
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
Genaro Juárez Martínez, Kenichi Mori...
EUROCRYPT
2010
Springer
14 years 5 days ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...