Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Riis, Soren - Department of Computer Science, Queen Mary, University of London
On Complexity gaps for Resolution-based proof systems Stefan Dantchev
On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity Department of Computer Science
Reversible and Irreversible information networks Queen Mary, University of London
Utilising public information in Network Coding Queen Mary, University of London
Information flows, graphs and their guessing Department of Computer Science
Tree Resolution proofs of the Weak Pigeon-Hole Principle Stefan Dantchev
A Dimension Theorem for Permutation Modules Queen Mary, University of London
