VSL 2014: VIENNA SUMMER OF LOGIC 2014

Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time

Authors: Jean-Jose Razafindrakoto and Arnold Beckmann

PapersPapers with AbstractsPrefaceAuthor IndexKeyword Index

Paper Information

Title:Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time
Authors:Jean-Jose Razafindrakoto and Arnold Beckmann
Proceedings:PC 2014 Abstracts
Editors: Jan Johannsen and Olaf Beyersdorff
Keywords:proof complexity, bounded arithmetic, search problems
Abstract:

ABSTRACT. Please, see attached pdf file.

Pages:0
Talk:Jul 12 16:30
Paper:
Disclaimer | Powered by EasyChair Smart Program