Bounded queries to SAT and the Boolean hierarchy (Q1178690): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/0304-3975(91)90160-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063158069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial terse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-immunity results for cheatable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terse, superterse, and verbose sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded query classes and the difference hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using self-reducibilities to characterize polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong exponential hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference and truth-table hierarchies for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inversion Complexity of a System of Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cardinality version of Beigel's nonspeedup theorem / 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: Trial and error predicates and the solution to a problem of Mostowski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703297 / rank
 
Normal rank

Latest revision as of 10:46, 15 May 2024

scientific article
Language Label Description Also known as
English
Bounded queries to SAT and the Boolean hierarchy
scientific article

    Statements

    Bounded queries to SAT and the Boolean hierarchy (English)
    0 references
    0 references
    26 June 1992
    0 references
    bounded queries
    0 references
    difference hierarchies
    0 references
    rounds of queries
    0 references
    separation of the hierarchies of functions
    0 references
    p-terseness
    0 references
    Boolean hierarchy
    0 references

    Identifiers