NDLI: Hyper-polynomial hierarchies and the NP-jump

Content Provider	IEEE Xplore Digital Library
Author	Fenner, S. Homer, S. Pruim, R. Schaefer, M.
Copyright Year	1997
Description	Author affiliation: Dept. of Comput. Sci., Univ. of Southern Maine, Portland, ME, USA (Fenner, S.)
Abstract	Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length /spl omega//sub 1//sup CK/ all of which are in PSPACE and uniformly hard for PH, such that successors are NP-jumps of their predecessors. This is analogous to the hyperarithmetic hierarchy which is defined similarly but with the (recursive) Turing degrees. The lack of uniform least upper bounds for ascending sequences of ptime degrees causes (the limit levels of) our hyper-polynomial hierarchy to be inherently non-canonical. This problem is investigated in depth, and various possible structures for hyper-polynomial hierarchies are explicated, as are properties of the NP-jump operator on the languages which are in PSPACE but not in PH.
Starting Page	102
Ending Page	110
File Size	891855
Page Count	9
File Format	PDF
ISBN	0818679077
ISSN	10930159
DOI	10.1109/CCC.1997.612305
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-06-24
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Computer science Arithmetic Complexity theory Upper bound Educational institutions Logic
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hyper-Polynomial Hierarchies and the NP-Jump

On the Power of Homogeneous Depth 4 Arithmetic Circuits

Hyper-polynomial hierarchies and the np-jump.

Linear complexity for sequences with characteristic polynomial $ƒ^{v}$

Bounded arithmetic and computational complexity

Polynomial identity testing for depth 3 circuits

Complexity transfer for modal logic

Boolean functions, invariance groups and parallel complexity

Complexity Lower Bounds through Balanced Graph Properties

Hyper-polynomial hierarchies and the NP-jump

Similar Documents

Hyper-Polynomial Hierarchies and the NP-Jump

On the Power of Homogeneous Depth 4 Arithmetic Circuits

Hyper-polynomial hierarchies and the np-jump.

Linear complexity for sequences with characteristic polynomial $ƒ^{v}$

Bounded arithmetic and computational complexity

Polynomial identity testing for depth 3 circuits

Complexity transfer for modal logic

Boolean functions, invariance groups and parallel complexity

Complexity Lower Bounds through Balanced Graph Properties

Hyper-polynomial hierarchies and the NP-jump