1399 search results - page 62 / 280 » Multi-party Finite Computations |
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
ICFCA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...