No Cover Image

Journal article 540 views

Computational complexity with experiments as oracles. II. Upper bounds / Edwin, Beggs; John, Tucker

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Volume: 465, Issue: 2105, Pages: 1453 - 1465

Swansesa University Authors: Edwin, Beggs, John, Tucker

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1098/rspa.2008.0412

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
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T11:47:27Z
last_indexed 2018-02-09T04:27:00Z
id cronfa149
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2013-10-17T15:57:17.4334627</datestamp><bib-version>v2</bib-version><id>149</id><entry>2011-10-01</entry><title>Computational complexity with experiments as oracles. II. Upper bounds</title><swanseaauthors><author><sid>a0062e7cf6d68f05151560cdf9d14e75</sid><ORCID>0000-0002-3139-0983</ORCID><firstname>Edwin</firstname><surname>Beggs</surname><name>Edwin Beggs</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>431b3060563ed44cc68c7056ece2f85e</sid><ORCID>0000-0003-4689-8760</ORCID><firstname>John</firstname><surname>Tucker</surname><name>John Tucker</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2011-10-01</date><deptcode>SMA</deptcode><abstract></abstract><type>Journal Article</type><journal>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</journal><volume>465</volume><journalNumber>2105</journalNumber><paginationStart>1453</paginationStart><paginationEnd>1465</paginationEnd><publisher/><placeOfPublication/><issnPrint>1364-5021</issnPrint><issnElectronic>1471-2946</issnElectronic><keywords/><publishedDay>1</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2009</publishedYear><publishedDate>2009-01-01</publishedDate><doi>10.1098/rspa.2008.0412</doi><url/><notes>Proceedings of the Royal Society Series A 465</notes><college>COLLEGE NANME</college><department>Mathematics</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SMA</DepartmentCode><institution>Swansea University</institution><lastEdited>2013-10-17T15:57:17.4334627</lastEdited><Created>2011-10-01T00:00:00.0000000</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>E</firstname><surname>Beggs</surname><order>1</order></author><author><firstname>J. F</firstname><surname>Costa</surname><order>2</order></author><author><firstname>B</firstname><surname>Loff</surname><order>3</order></author><author><firstname>J.V</firstname><surname>Tucker</surname><order>4</order></author><author><firstname>Edwin</firstname><surname>Beggs</surname><orcid>0000-0002-3139-0983</orcid><order>5</order></author><author><firstname>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>6</order></author></authors><documents/></rfc1807>
spelling 2013-10-17T15:57:17.4334627 v2 149 2011-10-01 Computational complexity with experiments as oracles. II. Upper bounds a0062e7cf6d68f05151560cdf9d14e75 0000-0002-3139-0983 Edwin Beggs Edwin Beggs true false 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2011-10-01 SMA Journal Article Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465 2105 1453 1465 1364-5021 1471-2946 1 1 2009 2009-01-01 10.1098/rspa.2008.0412 Proceedings of the Royal Society Series A 465 COLLEGE NANME Mathematics COLLEGE CODE SMA Swansea University 2013-10-17T15:57:17.4334627 2011-10-01T00:00:00.0000000 College of Science Computer Science E Beggs 1 J. F Costa 2 B Loff 3 J.V Tucker 4 Edwin Beggs 0000-0002-3139-0983 5 John Tucker 0000-0003-4689-8760 6
title Computational complexity with experiments as oracles. II. Upper bounds
spellingShingle Computational complexity with experiments as oracles. II. Upper bounds
Edwin, Beggs
John, Tucker
title_short Computational complexity with experiments as oracles. II. Upper bounds
title_full Computational complexity with experiments as oracles. II. Upper bounds
title_fullStr Computational complexity with experiments as oracles. II. Upper bounds
title_full_unstemmed Computational complexity with experiments as oracles. II. Upper bounds
title_sort Computational complexity with experiments as oracles. II. Upper bounds
author_id_str_mv a0062e7cf6d68f05151560cdf9d14e75
431b3060563ed44cc68c7056ece2f85e
author_id_fullname_str_mv a0062e7cf6d68f05151560cdf9d14e75_***_Edwin, Beggs
431b3060563ed44cc68c7056ece2f85e_***_John, Tucker
author Edwin, Beggs
John, Tucker
format Journal article
container_title Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
container_volume 465
container_issue 2105
container_start_page 1453
publishDate 2009
institution Swansea University
issn 1364-5021
1471-2946
doi_str_mv 10.1098/rspa.2008.0412
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
document_store_str 0
active_str 0
published_date 2009-01-01T18:13:22Z
_version_ 1656000141530759168
score 10.877734