Sciweavers

1071 search results - page 91 / 215
» The Calculus of Algebraic Constructions
Sort
View
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ACISP
2003
Springer
15 years 11 months ago
New Constructions for Resilient and Highly Nonlinear Boolean Functions
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
Khoongming Khoo, Guang Gong
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
15 years 8 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
TOC
2010
147views Management» more  TOC 2010»
15 years 27 days ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
DCC
2006
IEEE
16 years 5 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...