5 citations · 5 across the 4 of their papers we have counts for
6 papers
An Improved Lower Bound for Separating Words by Permutation Automata
Chen Xu, Kenneth Regan
We prove that some pairs of binary words of every sufficiently large prescribed length require states to separate by a deterministic finite automaton whos…
Multi-Structural Games and Number of Quantifiers
Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan +1
We study multi-structural games, played on two sets and of structures. These games generalize Ehrenfeucht-Fraïssé games. Whereas Ehrenfeucht-Fraïssé gam…
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
Chaowen Guan, Kenneth W. Regan
We show that a form of strong simulation for -qubit quantum stabilizer circuits is computable in time, where is the exponent of matrix multiplication. Solut…
Hilbert's Proof of His Irreducibility Theorem
Mark B. Villarino, Bill Gasarch, Kenneth Regan
Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and comb…
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets
Robert L. Surowka, Kenneth W. Regan
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significa…
Simulating Special but Natural Quantum Circuits
Richard J. Lipton, Kenneth W. Regan, Atri Rudra
We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g…