An applicative theory for FPH
Reinhard Kahle (CENTRIA, DM, FCT, Universidade Nova de Lisboa),, Isabel Oitavem (CMAF, Universidade de Lisboa, DM, FCT, Universidade Nova, de Lisboa)
TL;DR
This paper introduces an applicative theoretical framework that characterizes the polynomial hierarchy of time, providing a new perspective on computational complexity.
Contribution
The paper presents a novel applicative theory specifically designed to characterize the polynomial hierarchy of time.
Findings
Provides a formal theoretical framework for polynomial hierarchy
Establishes connections between applicative theories and complexity classes
Lays groundwork for future complexity-theoretic research
Abstract
In this paper we introduce an applicative theory which characterizes the polynomial hierarchy of time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.