نتائج البحث

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories ...

• Authors : Antonelli, Melissa; Dal Lago, Ugo; Davoli, Davide

Subjects: Bounded Arithmetic; Randomized Computation; Implicit Computational Complexity

تفاصيل العنوان

Models of Bounded Arithmetic Theories and Some Related Complexity Questions

• Authors : Abolfazl Alam; Morteza Moniri

Subjects: bounded arithmetic; complexity theory; existentially closed model

• Source: Bulletin of the Section of Logic, Vol 51, Iss 2, Pp 163-176 (2022)

تفاصيل العنوان

Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds ...

• Authors : Khaniki, Erfan

Subjects: Proof complexity; Bounded arithmetic; Bounded depth Frege

تفاصيل العنوان

Models of Bounded Arithmetic Theories and Some Related Complexity Questions

• Authors : Alam, Abolfazl; Moniri, Morteza

Subjects: bounded arithmetic; complexity theory; existentially closed model

• Source: Bulletin of the Section of Logic; Vol. 51 No. 2 (2022); 163-176 ; Bulletin of the Section of Logic; Tom 51 Nr 2 (2022); 163-176 ; 2449-836X ; 0138-0680

تفاصيل العنوان

From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk) ...

• Authors : Tzameret, Iddo

Subjects: Bounded arithmetic; complexity class separations; circuit complexity

تفاصيل العنوان

On the pigeonhole and the modular counting principles over the bounded arithmetic $V^{0}$ (Theory and Applications of Proof and Computation)

• Authors : Ken, Eitetsu

Subjects: pigeonhole principle; uniform counting principle; V⁰

• Source: 数理解析研究所講究録. 2228:186-205

تفاصيل العنوان

INCOMPLETENESS IN THE FINITE DOMAIN

• Authors : PUDLÁK, PAVEL

• Source: The Bulletin of Symbolic Logic, 2017 Dec 01. 23(4), 405-441.

تفاصيل العنوان

On Rules and Parameter Free Systems in Bounded Arithmetic

• Authors : Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix ...

Subjects: Bounded arithmetic; Conservation results; Parameter free schemes

تفاصيل العنوان

Feasibly constructive proofs of succinct weak circuit lower bounds

• Authors : Muller, Moritz Martin; Pich, Ján; Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

Subjects: Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat; Polynomials; Computational complexity

تفاصيل العنوان

Proof Complexity (Dagstuhl Seminar 18051)

• Authors : Atserias, Albert; Santhanam, Rahul

Subjects: bounded arithmetic; computational complexity; logic

• Source: Dagstuhl Reports, Volume 8, Issue 1; ISSN 2192-5283

تفاصيل العنوان