The following pages link to Kenneth W. Regan (Q845873):
Displaying 21 items.
- (Q705061) (redirect page) (← links)
- Games with uniqueness properties (Q705062) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Improved construction for universality of determinant and permanent (Q845874) (← links)
- Approximation of function evaluation over sequence arguments via specialized data structures (Q897968) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Minimum-complexity pairing functions (Q1201876) (← links)
- Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Exact computation of the number of accepting paths of an NTM (Q2636555) (← links)
- People, Problems, and Proofs (Q2864226) (← links)
- (Q2922358) (← links)
- Symmetric Functions Capture General Functions (Q3088060) (← links)
- (Q3148334) (← links)
- (Q3312209) (← links)
- (Q3340843) (← links)
- (Q3395945) (← links)
