Sciweavers

5 search results - page 1 / 1
» Descent polynomials for permutations with bounded drop size
Sort
View
EJC
2010
13 years 4 months ago
Descent polynomials for permutations with bounded drop size
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
Fan R. K. Chung, Anders Claesson, Mark Dukes, Rona...
DAM
2007
177views more  DAM 2007»
13 years 4 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 6 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
DAGSTUHL
2007
13 years 6 months ago
Uniqueness of Optimal Mod 3 Circuits for Parity
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
Frederic Green, Amitabha Roy
ICALP
2009
Springer
14 years 4 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh