Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Algorithms and Complexity Theory
Are there optimal reuse distance constraints for FAPs with random Tx placements?
Are there optimal reuse distance constraints for FAPs with random Tx placements?
J.E.Bater‚ P.G.Jeavons and D.A.Cohen
Institution
Royal Holloway‚ University of London
Month
February
Number
CSD−TR−98−01
Year
1998
Links
BibTeX
Link (ps)
See Also
Peter Jeavons
Constraint Satisfaction Problems
Algorithms and Complexity Theory
Activities
Projects
People
Publications
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top