Results 31 to 40 of about 1,679,233 (282)
Improved security analysis for OMAC as a pseudorandom function
Journal of Mathematical Cryptology, 2009 This paper shows that the advantage of any q-query adversary (which makes at most q queries) for distinguishing OMAC from a uniform random function is roughly Lq2/2n.
Nandi Mridul
doaj +1 more source
An upper bound for the Z-spectral radius of adjacency tensors
Journal of Inequalities and Applications, 2018 Let H $\mathcal{H}$ be a k-uniform hypergraph on n vertices with degree sequence Δ=d1≥⋯≥dn=δ $\Delta=d_{1} \geq\cdots\geq d_{n}=\delta$. In this paper, in terms of degree di $d_{i}$, we give a new upper bound for the Z-spectral radius of the adjacency ...
Zhi-Yong Wu +3 more
doaj +1 more source
An Exploration of Multicalibration Uniform Convergence Bounds
CoRR, 2022 Recent works have investigated the sample complexity necessary for fair machine learning. The most advanced of such sample complexity bounds are developed by analyzing multicalibration uniform convergence for a given predictor class. We present a framework which yields multicalibration error uniform convergence bounds by reparametrizing sample ...
Harrison Rosenberg +3 more
openaire +3 more sources
, 2000 Annual; Calendar year 1999-; At head of title: State of ...
Connecticut. Commission on Uniform Legislation.
core +7 more sources
Electronic Notes in Theoretical Computer Science, 2002 AbstractWe investigate the computable content of the Uniform Boundedness Theorem which states that a pointwise bounded sequence of bounded linear operators on Banach spaces is also uniformly bounded. But, given the sequence, can we also effectively find the uniform bound? It turns out that the answer depends on how the sequence is “given”.
openaire +2 more sources
Sunflowers and -intersecting families
AKCE International Journal of Graphs and Combinatorics, 2020 Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .
Gábor Hegedűs
doaj +1 more source
A Burgess-like subconvex bound for twisted L-functions [PDF]
, 2007 Let g be a cuspidal newform (holomorphic or Maass) of arbitrary level and nebentypus, X a primitive character of conductor q, and s a point on the critical line Rs = 1/2.
Michel, Philippe +6 more
core +2 more sources
Uniform bound for Hecke L-functions
Acta Mathematica, 2005 50 ...
Jutila, Matti, Motohashi, Yoichi
openaire +4 more sources
On Medium-Uniformity and Circuit Lower Bounds [PDF]
2013 IEEE Conference on Computational Complexity, 2013 We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits. Our results can be divided into two parts: 1. Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex (stronger
Rahul Santhanam, Ryan Williams 0001
openaire +1 more source
A Uniform Asymptotical Upper Bound for the Variance of a Random Polytope in a Simple Polytope
Моделирование и анализ информационных систем, 2015 The present paper contains a sketch of the proof of an upper bound for the variance of the number of hyperfaces of a random polytope when the mother body is a simple polytope.
A. Magazinov
doaj +3 more sources