Centre for Discrete Mathematics and Theoretical Computer Science


Research Reports


Showing Year 2016 Reports

ID Author & Report Title Date Action
494
Title:
Bounds on the Kolmogorov complexity function for infinite words
Name:
L. Staiger
01/2016
495
Title:
Formulating Graph Covering Problems for Adiabatic Quatumn Computers
Name:
M.J. Dinneen and R. Hua
02/2016
496
Title:
SQL Schema Design: Foundations, Normal Forms, and Normalization
Name:
H. Kohler and S. Link
04/2016
497
Title:
Incompleteness, Undecidability and Automated Proofs
Name:
C.S. Calude and D. Thompson
05/2016
498
Title:
A Computational Mathematics View of Space, Time and Complexity
Name:
D.H. Bailey and J.M. Borwein
09/2016
499
Title:
QUBO Formulations for the Graph Isomorphism Problem and Related Problems
Name:
C.S. Calude, M.J. Dinneen and R. Hua
10/2016
500
Title:
Deciding Parity Games in Quasipolynomial Time
Name:
C.S. Calude, S. Jain, B. Khoussainov, W. Li and F. Stephan
10/2016
501
Title:
Shift-Invariant Topologies for the Cantor Space X^omega
Name:
S. Hoffmann, S. Schwarz and L. Staiger
11/2016
502
Title:
Exact Constructive and Computable Dimensions
Name:
L. Staiger
11/2016
503
Title:
Graph Minor Embeddings for D-Wave Computer Architecture
Name:
Z. Yang and M.J. Dinneen
11/2016


Please give us your feedback or ask us a question

This message is...


My feedback or question is...


My email address is...

(Only if you need a reply)

A to Z Directory | Site map | Accessibility | Copyright | Privacy | Disclaimer | Feedback on this page