Kenneth W. Regan

Available identifiers

zbMath Open regan.kenneth-wDBLPr/KWReganWikidataQ27530660 ScholiaQ27530660MaRDI QIDQ845873

List of research outcomes

Publication	Date of Publication	Type
Algebraic and Logical Emulations of Quantum Circuits	2021-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q5857675	2021-04-02	Paper
Hilbert’s Proof of His Irreducibility Theorem	2018-07-11	Paper
Exact computation of the number of accepting paths of an NTM	2018-06-05	Paper
Approximation of function evaluation over sequence arguments via specialized data structures	2015-12-08	Paper
Efficient Memoization for Approximate Function Evaluation over Sequence Arguments	2015-05-20	Paper
Quantum algorithms via linear algebra. A primer	2014-10-10	Paper
People, Problems, and Proofs	2013-12-06	Paper
Improved simulation of nondeterministic Turing machines	2012-03-13	Paper
Symmetric functions capture general functions (extended abstract)	2011-08-17	Paper
Improved simulation of nondeterministic Turing machines	2010-09-03	Paper
Improved construction for universality of determinant and permanent	2010-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q3395945	2009-09-15	Paper
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas	2009-03-06	Paper
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle	2009-01-08	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Games with uniqueness properties	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4736857	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q3148334	2002-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q4942632	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4375789	1998-10-11	Paper
Parameterized circuit complexity and the \(W\) hierarchy	1998-08-13	Paper
Gap-languages and log-time complexity classes	1998-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q4359464	1997-10-08	Paper
Index sets and presentations of complexity classes	1997-09-18	Paper
Performance of neural net heuristics for maximum clique on diverse highly compressible graphs	1997-07-23	Paper
The power of the middle bit of a \(\#\)P function	1996-11-04	Paper
Linear Time and Memory-Efficient Computation	1996-07-02	Paper
On closure properties of bounded two-sided error complexity classes	1995-12-13	Paper
Diagonalization, uniformity, and fixed-point theorems	1993-01-17	Paper
Minimum-complexity pairing functions	1993-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q3762301	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3765753	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340843	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3312209	1983-01-01	Paper

Research outcomes over time

This page was built for person: Kenneth W. Regan