Mean-payoff games and propositional proofs (Q716324): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automatizability of resolution and related propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean-Payoff Games and Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Max-Atom Problem and Its Relevance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial structure and randomized subexponential algorithms for infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-automatizability of bounded-depth Frege proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Subexponential Algorithm for Solving Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 23:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Mean-payoff games and propositional proofs
scientific article

    Statements

    Mean-payoff games and propositional proofs (English)
    0 references
    0 references
    0 references
    28 April 2011
    0 references
    mean-payoff games
    0 references
    proof complexity
    0 references
    resolution
    0 references
    Frege proof system
    0 references
    automatizability
    0 references
    feasible interpolation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers