Sciweavers

1763 search results - page 125 / 353
» A Formalization of Polytime Functions
Sort
View
DAC
2010
ACM
15 years 1 months ago
Theoretical analysis of gate level information flow tracking
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...
Jason Oberg, Wei Hu, Ali Irturk, Mohit Tiwari, Tim...
CIE
2006
Springer
15 years 1 months ago
Coinductive Proofs for Basic Real Computation
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
Tie Hou
CODES
2001
IEEE
15 years 1 months ago
Development cost and size estimation starting from high-level specifications
This paper addresses the problem of estimating cost and development effort of a system, starting from its complete or partial high-level description. In addition, some modificatio...
William Fornaciari, Fabio Salice, Umberto Bondi, E...
FFA
2008
42views more  FFA 2008»
14 years 10 months ago
Weyl sums in Fq[x] with digital restrictions
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
Manfred G. Madritsch, Jörg M. Thuswaldner
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 10 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert