- Reducibility and Completeness Chapter 28 of the forthcoming CRC Handbook on Algorithms and Theory
- ``Resistant'' Polynomials and Stronger Lower Bounds for DepthThree Arithmetical Formulas
- Polynomial Vicinity Circuits and Nonlinear Lower Bounds Kenneth W. Regan \Lambda
- "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
- A Non-Linear Lower Bound for Constant Depth Arithmetical Circuits via the Discrete Uncertainty Principle
- Understanding the Mulmuley-Sohoni Approach to P vs. NP Kenneth W. Regan
- On Arithmetical Formulas Whose Jacobians are Grobner Bases Denis X. Charles
- Parameterized Circuit Complexity and the W Hierarchy Rodney G. Downey1
- Games With Uniqueness Properties by Shin Aida1
- Skill Rating by Bayesian Inference Giuseppe Di Fatta, Guy McC. Haworth and Kenneth W. Regan
- Intrinsic Chess Ratings Kenneth W. Regan
- This is page 1 Printer: Opaque this
- Machine Models and Linear Time Complexity Kenneth W. Regan1
- Complexity Classes Chapter 27 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- Other Complexity Classes and Measures Chapter 29 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- Graded Self-Reducibility Mitsunori Ogihara
- A Protocol for Serializing Unique Strategies Marcel Crasmaru1
- LINEAR TIME AND MEMORYEFFICIENT COMPUTATION KENNETH W. REGAN #
- Games With Uniqueness Properties by Shin Aida 1 , Marcel Crasmaru 2 , Kenneth Regan 3 , and Osamu Watanabe 2
- Linear-Time Algorithms in Memory Hierarchies Kenneth W. Regana
- UPSILON: Universal Programming System with Incomplete Lazy Object Notation
- Performance of Neural Network Algorithms for Maximum Clique On Highly Compressible Graphs
- LOWER BOUND FRONTIERS IN ARITHMETICAL CIRCUIT COMPLEXITY Maurice Julien Jansen
- Complexity Classes Chapter 27 of the forthcoming CRC Handbook on Algorithms and Theory
- A Protocol for Serializing Unique Strategies Marcel Crasmaru 1 , Christian Glaer #2 , Kenneth W. Regan ##3 , and Samik
- Complexity Classes Chapter 27 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- Understanding the Mulmuley-Sohoni Approach to P vs. NP Kenneth W. Regan
- Parameterized Circuit Complexity and the W Hierarchy Rodney G. Downey 1 Michael R. Fellows 2 Kenneth W. Regan 3
- On Closure Properties of Bounded 2-Sided Error Complexity Classes
- Reducibility and Completeness Chapter 28 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- The Power of the Middle Bit of a #P Function (Revised Version)
- Other Complexity Classes and Measures Chapter 29 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- Towards Arithmetical Lower Bounds with Unbounded Coe#cients Maurice J. Jansen
- The Power of the Middle Bit of a #P Function (Revised Version)
- Reducibility and Completeness Chapter 28 of the forthcoming CRC Handbook on Algorithms and Theory of Computation
- Pseudorandom Generators, Measure Theory, and Natural Proofs Kenneth W. Regan \Lambda D. Sivakumar + Jinyi Cai #
- Machine Models and Linear Time Complexity Kenneth W. Regan 1
- Probabilistic Martingales and BPTIME Classes Kenneth W. Regan \Lambda
- LOWER BOUND FRONTIERS IN ARITHMETICAL CIRCUIT COMPLEXITY Maurice Julien Jansen
- J. van den Herik and P. Spronck (Eds.): ACG 2009, LNCS 6048, pp. 99110, 2010. Springer-Verlag Berlin Heidelberg 2010
- UPSILON: Universal Programming System with Incomplete Lazy Object Notation
- On Superlinear Lower Bounds in Complexity Theory Kenneth W. Regan \Lambda
- On Quasilinear Time Complexity Theory Ashish V. Naik 1
- Other Complexity Classes and Measures Chapter 29 of the forthcoming CRC Handbook on Algorithms and Theory
- Branching Programs with Variables, and Implications for Time-Space Tradeoffs
- LinearTime Algorithms in Memory Hierarchies Kenneth W. Regan a#
- Descriptive Complexity and the W Hierarchy Rodney G. Downey, Michael R. Fellows, and Kenneth W. Regan
- Linear Speed-Up, Information Vicinity, and Finite-State Machines Kenneth W. Regana
- The Quasilinear Isomorphism Challenge Kenneth W. Regan
- A New Parallel Vector Model, With Exact Characterizations Kenneth W. Regan
- Improved Construction for Universality of Determinant and Permanent
- On Arithmetical Formulas Whose Jacobians are Grobner Bases Denis X. Charles
- A New Parallel Vector Model, With Exact Characterizations Kenneth W. Regan #
- Information Capacity of Binary Weights Associative Arun Jagota
- On Closure Properties of Bounded 2Sided Error Complexity Classes
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- On Superlinear Lower Bounds in Complexity Theory Kenneth W. Regan
- Communication Complexity of Key Agreement on Small Ranges
- Communication Complexity of Key Agreement on Small Ranges
- The Quasilinear Isomorphism Challenge Kenneth W. Regan # Jie Wang +
- A NonLinear Lower Bound for Constant Depth Arithmetical Circuits via the Discrete Uncertainty Principle
- Orbits and Arithmetical Circuit Lower Bounds Maurice J. Jansen1 and Kenneth W.Regan 1
- On Quasilinear Time Complexity Theory Ashish V. Naik1
- Graded SelfReducibility Mitsunori Ogihara #
- Polynomial Vicinity Circuits and Nonlinear Lower Bounds Kenneth W. Regan
- Improved Construction for Universality of Determinant and Permanent
- A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem
- The Journal of Fourier Analysis and Applications On Determinants of
- Probabilistic Martingales and BPTIME Classes Kenneth W. Regan
- Pseudorandom Generators, Measure Theory, and Natural Proofs Kenneth W. Regan
- This is page 1 Printer: Opaque this
- A Generalization of ResourceBounded Measure, With Application to the BPP vs. EXP Problem
- Linear SpeedUp, Information Vicinity, and FiniteState Machines Kenneth W. Regan a
- Branching Programs with Variables, and Implications for Time-Space Tradeo s
- LINEAR TIME AND MEMORY-EFFICIENT COMPUTATION KENNETH W. REGAN
- Improved Simulation of Nondeterministic Turing Subrahmanyam Kalyanasundarama,
- Symmetric Functions Capture General Functions Richard J. Lipton
- Understanding Distributions of Chess Performances Kenneth W. Regan1
- Understanding Distributions of Chess Performances Kenneth W. Regan1
- Intrinsic Ratings Compendium (WORKING DRAFT)
- Simulating Special but Natural Quantum Circuits Richard J. Lipton
