Sciweavers

220 search results - page 16 / 44
» New degree bounds for polynomial threshold functions
Sort
View
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
14 years 2 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret
DM
2010
140views more  DM 2010»
13 years 7 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
TIT
2008
130views more  TIT 2008»
13 years 7 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro