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

@@ Property / author @@
+João P. Marques-Silva
@@ Property / author: João P. Marques-Silva / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2016.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2222364239
@@ Property / OpenAlex ID: W2222364239 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62047278
@@ Property / Wikidata QID: Q62047278 / rank @@
+Normal rank
@@ Property / cites work @@
+Axiom Pinpointing in General Tableaux
@@ Property / cites work: Axiom Pinpointing in General Tableaux / rank @@
+Normal rank
@@ Property / cites work @@
+Property-directed incremental invariant generation
+Normal rank
@@ Property / cites work @@
+Q2752124
@@ Property / cites work: Q2752124 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of selecting maximal solutions
@@ Property / cites work: The complexity of selecting maximal solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for computing backbones of propositional formulae
+Normal rank
@@ Property / cites work @@
+Minimal sets on propositional formulae. Problems and reductions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Removing redundancy from a clause
@@ Property / cites work: Removing redundancy from a clause / rank @@
+Normal rank
@@ Property / cites work @@
+Q4359460
@@ Property / cites work: Q4359460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4488342
@@ Property / cites work: Q4488342 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5503674
@@ Property / cites work: Q5503674 / rank @@
+Normal rank
@@ Property / cites work @@
+On truth-table reducibility to SAT
@@ Property / cites work: On truth-table reducibility to SAT / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of complexity classes of functions
@@ Property / cites work: A taxonomy of complexity classes of functions / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+Q5593816
@@ Property / cites work: Q5593816 / rank @@
+Normal rank
@@ Property / cites work @@
+Oracles That Compute Values
@@ Property / cites work: Oracles That Compute Values / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411161
@@ Property / cites work: Q4411161 / rank @@
+Normal rank
@@ Property / cites work @@
+Consistent subsets of inconsistent systems: structure and behaviour
+Normal rank
@@ Property / cites work @@
+Algorithms for computing minimal unsatisfiable subsets of constraints
+Normal rank
@@ Property / cites work @@
+The complexity of facets resolved
@@ Property / cites work: The complexity of facets resolved / rank @@
+Normal rank
@@ Property / cites work @@
+Q5309031
@@ Property / cites work: Q5309031 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractable Reductions to SAT
@@ Property / cites work: Fixed-Parameter Tractable Reductions to SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/ai/JanotaM16
@@ Property / DBLP publication ID: journals/ai/JanotaM16 / rank @@
+Normal rank