Singularity of Sparse Circulant Matrices is NP-complete

Small Spans in Scaled Dimension

Small Turing universal signal machines

Small weakly universal Turing machines

Smoothed Complexity Theory

Software Engineering and Complexity in Effective Algebraic Geometry

Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP

Solution of the Linear Ordering Problem (NP=P)

Solution of the propeller conjecture in $\R^3$

Solving Mahjong Solitaire boards with peeking

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space

Solving the P/NP Problem under Intrinsic Uncertainty

Solving the Rural Postman problem using the Adleman-Lipton model

Some Applications of Coding Theory in Computational Complexity

Some Considerations on Universality

Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial

Some remarks on the survey decimation algorithm for K-satisfiability

Some results on equivalence of multi-letter quantum finite automata

Some results on more flexible versions of Graph Motif

Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs