Sciweavers

397 search results - page 45 / 80
» Pseudorandom Functions and Lattices
Sort
View
TCS
2008
15 years 1 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 7 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 3 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ECCC
2007
123views more  ECCC 2007»
15 years 1 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
ADBIS
2010
Springer
203views Database» more  ADBIS 2010»
15 years 7 days ago
Detecting XML Functional Dependencies through Formal Concept Analysis
Abstract. As XML becomes a popular data representation and exchange format over the web, XML schema design has become an important research area. Formal Concept Analysis (FCA) has ...
Katalin Tunde Janosi-Rancz, Viorica Varga, Timea N...