Journal article 1952 views
Computational complexity with experiments as oracles. II. Upper bounds
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Volume: 465, Issue: 2105, Pages: 1453 - 1465
Swansea University Authors:
Edwin Beggs , John Tucker
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1098/rspa.2008.0412
Abstract
Computational complexity with experiments as oracles. II. Upper bounds
| Published in: | Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences |
|---|---|
| ISSN: | 1364-5021 1471-2946 |
| Published: |
2009
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa149 |
| Item Description: |
Proceedings of the Royal Society Series A 465 |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
2105 |
| Start Page: |
1453 |
| End Page: |
1465 |

