Backdoor sets of quantified Boolean formulas (Q1040783): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Quantor / rank
 
Normal rank
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.1007/s10817-008-9114-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039585983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Universal Expansion for Preprocessing QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable and term removal from Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \#SAT using vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Dependencies of Quantified CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor Sets of Quantified Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Clause Reasoning in QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets for DLL subsolvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of matched CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matched Formulas and Backdoor Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 06:01, 2 July 2024

scientific article
Language Label Description Also known as
English
Backdoor sets of quantified Boolean formulas
scientific article

    Statements

    Backdoor sets of quantified Boolean formulas (English)
    0 references
    0 references
    0 references
    25 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    quantified Boolean formulas
    0 references
    backdoor sets
    0 references
    variable dependencies
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references