Boolean operations, joins, and the extended low hierarchy (Q1275091): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
Normal rank
 
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sets, Lowness and Highness / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selectivity: Intersections and indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Solutions Uniquely Collapses the Polynomial Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the low and high hierarchies by oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating \(P\)/poly optimally in the extended low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Circuit-Size Complexity and the Low Hierarchy in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic complexity classes and lowness / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Extended Low Hierarchy is an Infinite Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:01, 28 May 2024

scientific article
Language Label Description Also known as
English
Boolean operations, joins, and the extended low hierarchy
scientific article

    Statements

    Boolean operations, joins, and the extended low hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    0 references
    closure properties
    0 references
    computational complexity
    0 references
    extended low hierarchy
    0 references
    information extraction algorithms
    0 references
    joins
    0 references