2012•Lecture notes in computer scienceOpen access

Instance Compression for the Polynomial Hierarchy and beyond

Chiranjit Chakraborty, Rahul Santhanam

Open full text 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: PSPACE, Mathematics, Polynomial hierarchy, Discrete mathematics, Combinatorics, Boolean satisfiability problem, Decidability, Satisfiability

Back to paper search Browse research topics Original source

Instance Compression for the Polynomial Hierarchy and beyond — Research Paper | ScholarLens