output
20022013
most citedQuantum Computing

3.6k citations

Showing 2011Show all

43 papers · 1 filter

cs.DS2011

Succinct Representations of Permutations and Functions

J. Ian Munro, Rajeev Raman, Venkatesh Raman +1

We investigate the problem of succinctly representing an arbitrary permutation, π, on {0,...,n-1} so that π^k(i) can be computed quickly for any i and any (positive or negative) in…

math.OC2011

A proximal point algorithm for sequential feature extraction applications

Xuan Vinh Doan, Kim-Chuan Toh, Stephen Vavasis

We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a "large approximately rank-one submatrix". This LAROS problem is used to sequentially…

math.NA20111 cited

Steepest Descent Preconditioning for Nonlinear GMRES Optimization

Hans De Sterck

Steepest descent preconditioning is considered for the recently proposed nonlinear generalized minimal residual (N-GMRES) optimization algorithm for unconstrained nonlinear optimiz…

cs.DS201111 cited

Algorithms for Solving Rubik's Cubes

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat +2

The Rubik's Cube is perhaps the world's most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the R…

cs.IT20112 cited

Large Zero Autocorrelation Zone of Golay Sequences and -QAM Golay Complementary Sequences

Guang Gong, Fei Huo, Yang Yang

Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some const…

math.NT2011

Ideals of degree one contribute most of the height

Aaron Levin, David McKinnon

Let be a number field, a polynomial over with , and the group of -units of , where is an appropriate finite set of places o…