Title:
|
The ordering principle in a fragment of approximate counting
|
Author:
|
Atserias, Albert; Thapen, Neil
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
Abstract:
|
The ordering principle states that every finite linear order has a least element. We show that, in the relativized setting, the surjective weak pigeonhole principle for polynomial time functions does not prove a Herbrandized version of the ordering principle over T-2(1). This answers an open question raised in Buss et al. [2012] and completes their program to compare the strength of Jerabek's bounded arithmetic theory for approximate counting with weakened versions of it. |
Abstract:
|
Peer Reviewed |
Subject(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat -Computational complexity -Theory -Algorithms -Bounded arithmetic -Propositional proof complexity -Polynomial local search -Weak Pigeonhole Principle -Complexitat computacional |
Rights:
|
|
Document type:
|
Article - Submitted version Article |
Share:
|
|