Easy Sets and Hard Certificate Schemes

Effective Strong Dimension, Algorithmic Information, and Computational Complexity

Efficiency Theory: a Unifying Theory for Information, Computation and Intelligence

Efficient algorithms for deciding the type of growth of products of integer matrices

Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

Efficient Implementation of Rewriting Revisited Technical Report

Efficiently Testing Sparse GF(2) Polynomials

Elementary Complexity and von Neumann Algebras

Elementary Proof of a Theorem of Jean Ville

Empirical Encounters with Computational Irreducibility and Unpredictability

Energy Bounds for Fault-Tolerant Nanoscale Designs

Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory

Entropy generation in a model of reversible computation

Entropy, Convex Optimization, and Competitive Quantum Interactions

Enumerating Homomorphisms

Enumeration of the Monomials of a Polynomial and Related Complexity Classes

Enumeration Order complexity Equivalency

Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem

Equational Aspects of a Parametric Family of Computational Problems and Consequences

Equilibria, Fixed Points, and Complexity Classes