Computer Science Technical Reports
2018201720162015201420132012201120102009200820072006200520042003
1974
|
[RR-07-01] |
Learning to Extract Significant Phrases from Text Yuan J.Lui No. RR−07−01. Oxford University Computing Laboratory. 2007. |
|
[RR-07-04] |
An Analogue Solution to the Problem of Factorization Ed Blakey No. RR−07−04. Oxford University Computing Laboratory. July, 2007. |
|
[RR-07-05] |
Complete Positivity without Positivity and Without Compactness Bob Coecke No. RR−07−05. Oxford University Computing Laboratory. September, 2007. |
|
[RR-07-07] |
Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials Chris Jefferson‚ Peter Jeavons‚ Martin J. Green and M.R.C. van Dongen No. RR−07−07. Oxford University Computing Laboratory. October, 2007. |
|
[RR-07-08] |
Full Abstraction for Nominal Exceptions and General References Nikos Tzevelekos No. RR−07−08. Oxford University Computing Laboratory. October, 2007. |
|
[RR-07-03] |
The expressive power of valued constraints: hierarchies and collapses David A. Cohen‚ Peter G. Jeavons and Stanislav Živný No. RR−07−03. Computing Laboratory‚ University of Oxford. Oxford‚ UK. April, 2007. Details | BibTeX | Download (pdf) | Link |