7 citations · 11 across the 10 of their papers we have counts for
11 papers
Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
Peter Clifford, Raphaël Clifford
We study exact uniform sampling of permutations of length whose longest increasing subsequence (LIS) has prescribed length . Our main result is, to the best of our knowledge…
Faster classical Boson Sampling
Peter Clifford, Raphaël Clifford
Since its introduction Boson Sampling has been the subject of intense study in the world of quantum computing. The task is to sample independently from the set of all …
Reverting Processes
Peter Clifford, David Stirzaker
We consider random processes that are history-dependent, in the sense that the distribution of the next step of the process at any time depends upon the entire past history of the…
Ulam's History-dependent Random Adding Process
Peter Clifford, David Stirzaker
Ulam has defined a history-dependent random sequence of integers by the recursion where and are independently and unifo…
The Classical Complexity of Boson Sampling
Peter Clifford, Raphaël Clifford
We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distrib…
Pattern Matching under Polynomial Transformation
Ayelet Butman, Peter Clifford, Raphael Clifford +5
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse…