Reducing Tile Complexity for the Self-Assembly of Scaled Shapes Through Temperature Programming

Reductions Between Expansion Problems

Refutation of Aslam's Proof that NP = P

Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions

Relativized Propositional Calculus

Relativizing Small Complexity Classes and their Theories

Renormalization group approach to the P versus NP question

Repeating Patterns in Linear Programs that express NP-Complete Problems

Report on "Mathematical Aspects of P vs. NP and its Variants."

Report on article The Travelling Salesman Problem: A Linear Programming Formulation

Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem

Report on Generic Case Complexity

Representating groups on graphs

Representation and Measure of Structural Information

Representing a P-complete problem by small trellis automata

Residual Finite Tree Automata

Résolution du "partition problem" par une approche arithmétique

Resolution over Linear Equations and Multilinear Proofs

Resolving the Complexity of Some Data Privacy Problems

Resource Bounded Immunity and Simplicity