Equivalence and Isomorphism for Boolean Constraint Satisfaction

Errors in Improved Polynomial Algorithm For 3 Sat Proposed By Narendra Chaudhari

ESO universal Horn and LFP logics: separation between machine level and structure level

Essential Inputs and Minimal Tree Automata

Evasiveness and the Distribution of Prime Numbers

Even Faster Exact Bandwidth

Every Computably Enumerable Random Real Is Provably Computably Enumerable Random

Every decision tree has an influential variable

Evidence that P is not equal to NP

Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications

Exact Complexity of Exact-Four-Colorability

Exact Complexity of the Winner Problem for Young Elections

Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version)

Existentially Restricted Quantified Constraint Satisfaction

Explicit Optimal Hardness via Gaussian stability results

Exploring k-Colorability

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

Exponential Time Complexity of Weighted Counting of Independent Sets

Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation