Relativization makes contradictions harder for resolution (Q386151): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q386150 / rank
Normal rank
 
Property / author
 
Property / author: Stefan S. Dantchev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6238565 / rank
 
Normal rank
Property / zbMATH Keywords
 
proof complexity
Property / zbMATH Keywords: proof complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
resolution-with-bounded-conjunction
Property / zbMATH Keywords: resolution-with-bounded-conjunction / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized proof complexity
Property / zbMATH Keywords: parameterized proof complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089789793 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.4287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of DPLL Search Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of tree-like resolution size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Bounded-Depth Frege Is not Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativisation Provides Natural Separations for Resolution-Based Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Resolution with Bounded Conjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of first order structures and propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity gap for tree resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard tautologies using predicate logic and the symmetric group / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Relativization makes contradictions harder for resolution
scientific article

    Statements

    Relativization makes contradictions harder for resolution (English)
    0 references
    0 references
    0 references
    16 December 2013
    0 references
    proof complexity
    0 references
    lower bounds
    0 references
    resolution-with-bounded-conjunction
    0 references
    parameterized proof complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references