Homogeneous Permutations. Random Feistel schemes are never homogeneous Jacques Patarin Abstract In this paper we introduce two new concepts that are stronger than strong

Source URL: www.prism.uvsq.fr

COMPUTING THE PERMANENT OF (SOME) COMPLEX MATRICES Alexander Barvinok June 2014 Abstract. We present a deterministic algorithm, which, for any given 0 <  < 1

Source URL: www.math.lsa.umich.edu

• Algebra
• Mathematics
• Mathematical analysis
• Matrix theory
• Linear algebra
• Complex analysis
• Permanent
• Permutations
• Taylor series
• Determinant
• Matrix
• Inverse trigonometric functions

PERMUTATION STRINGS Jeffrey A. Barnett1 Problem: What is the length of the shortest string on an alphabet of n symbols that contains all n! permutations of the alphabet as (contiguous)

Source URL: www.notatt.com

Random permutations and partition models Peter McCullagh 1 University of Chicago JanuarySet partitions

Source URL: www.stat.uchicago.edu

Exploiting Probabilistic Independence for Permutations Jonathan Huang, Carlos Guestrin Stanford University Pittsburgh, Pennsylvania 15213

Source URL: select.cs.cmu.edu

• Mathematical analysis
• Mathematics
• Algebra
• Fourier analysis
• Mathematical physics
• Joseph Fourier
• Integral transforms
• Unitary operators
• Fourier transform
• Convolution
• Permutation group
• Permutation

Design of near - optimal pseudorandom functions and pseudorandom permutations in the information - theoretic model Abstract In this paper we will extend the Benes and Luby-Rackoff constructions to design various pseudora

Source URL: www.prism.uvsq.fr

FastPRP: Fast Pseudo-Random Permutations for Small Domains Emil Stefanov1 and Elaine Shi2 1 2

Source URL: web.rememberingemil.org

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Source URL: www.math.lsa.umich.edu

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

Balls of Permutations in the ℓ∞ -Metric Moshe Schwartz Electrical and Computer Engineering Ben-Gurion University of the Negev

Source URL: tce.webee.eedev.technion.ac.il

Constru ting Pseudo-Random Permutations with a Pres ribed Stru ture Moni Naor Omer Reingoldy

Source URL: omereingold.files.wordpress.com