Bounded queries, approximations, and the Boolean hierarchy (Q1854449): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.2000.2884 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031104867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between difference hierarchies and relativized polynomial hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Queries and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the query complexity of clique size and maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing Boolean connectives of characteristic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong exponential hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Downward Collapse within the Polynomial Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-Restricted Advice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricting the Size of Oracles Compared with Restricting Access to Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 5 June 2024

scientific article
Language Label Description Also known as
English
Bounded queries, approximations, and the Boolean hierarchy
scientific article

    Statements

    Bounded queries, approximations, and the Boolean hierarchy (English)
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references