On the query complexity of selecting minimal sets for monotone predicates (Q253999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/ai/JanotaM16, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62047278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiom Pinpointing in General Tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-directed incremental invariant generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selecting maximal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing backbones of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal sets on propositional formulae. Problems and reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing redundancy from a clause / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles That Compute Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent subsets of inconsistent systems: structure and behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Reductions to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ai/JanotaM16 / rank
 
Normal rank

Latest revision as of 21:48, 13 November 2024

scientific article
Language Label Description Also known as
English
On the query complexity of selecting minimal sets for monotone predicates
scientific article

    Statements

    On the query complexity of selecting minimal sets for monotone predicates (English)
    0 references
    0 references
    0 references
    8 March 2016
    0 references
    query complexity
    0 references
    monotone predicates
    0 references
    minimal set
    0 references
    SAT
    0 references
    backbone
    0 references
    minimal unsatisfiable set
    0 references
    minimal correction set
    0 references
    independent variables
    0 references

    Identifiers