Computing Solutions Uniquely Collapses the Polynomial Hierarchy

Journal article

Peer reviewed

Computing Solutions Uniquely Collapses the Polynomial Hierarchy

Lane A Hemaspaandra, Ashish V Naik, Mitsunori Ogihara and Alan L Selman

SIAM journal on computing, Vol.25(4), pp.697-708

1996-08

DOI: https://doi.org/10.1137/S0097539794268315

Metrics

9 Record Views

34 Times Cited - Web of Science

See more details

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types: Domestic collaboration; International collaboration
Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.182 Data Structures, Algorithms & Complexity; 4.182.1226 Computability
Web Of Science research areas: Computer Science, Theory & Methods; Mathematics, Applied
ESI research areas: Computer Science

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

Source: InCites

Details

Title: Computing Solutions Uniquely Collapses the Polynomial Hierarchy
Creators: Lane A Hemaspaandra
Ashish V Naik
Mitsunori Ogihara
Alan L Selman
Publication Details: SIAM journal on computing, Vol.25(4), pp.697-708
Academic Unit: College of A&S; A&S - Computer Science
Language: English
Resource Type: Journal article
Record Identifier: 991031614424302976