On the complexity of data disjunctions. (Q1853503): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logics as a unifying framework for the semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying disjunctive databases through nonmonotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct circuit representations and leaf language classes are basically the same concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional closed world reasoning and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity class θp2: Recent results and applications in AI and modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for second-order logic over finite structures, and classification of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized logspace and generalized quantifiers over finite ordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness as a source of complexity in logical formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing functions with parallel queries to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph problems with succinct multigraph representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why not negation by fixpoint? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization of questions about log space computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing protected circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on succinct representations of graphs / 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: Q5285980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5285981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time truth-table reducibility of intractable sets to P-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages represented by Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation, leaf languages, and projection reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 11:26, 5 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of data disjunctions.
scientific article

    Statements

    On the complexity of data disjunctions. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Data disjunction
    0 references
    Deductive databases
    0 references
    Computational complexity
    0 references
    Complexity upgrading
    0 references
    Conversion lemma
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references