Output details
11 - Computer Science and Informatics
Swansea University
Return to search
Output 0 of 0 in the submission
Chapter title
Characterising definable search problems in bounded arithmetic via proof notations
Type
C - Chapter in book
Publisher of book
De Gruyter
Book title
Ways of Proof Theory
ISBN of book
9783110324907
Year of publication
2010
URL
-
Number of additional authors
1
Additional information
<11> This 69 page paper reports on key applications developed in EPSRC project "Abstract Measures of Low-Level Computational Complexity" (EP/D03809X/1). It is based on methods and results reported in our REF output "On the computational complexity of cut-reduction". This research has been reported in 8 invited workshop and conference presentations, including a tutorial at the 16th International Workshop on Logic, Language, Information and Computation in Tokyo.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
