Pages that link to "Item:Q5948765"

The following pages link to Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765):

Displaying 39 items.

• Propositional logics of dependence (Q278765) (← links)
• Connectivity games over dynamic networks (Q391110) (← links)
• Complexity of fixed-size bit-vector logics (Q504997) (← links)
• Complexity of validity for propositional dependence logics (Q515658) (← links)
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
• Infinite games with finite knowledge gaps (Q528188) (← links)
• Computation of equilibria in noncooperative games (Q815274) (← links)
• Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
• Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
• Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
• Compositional and symbolic synthesis of reactive controllers for multi-agent systems (Q1641032) (← links)
• Imperfect information in reactive modules games (Q1641035) (← links)
• Complexity results for modal dependence logic (Q1956378) (← links)
• Building strategies into QBF proofs (Q2031411) (← links)
• Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
• Certified DQBF solving by definition extraction (Q2118343) (← links)
• DQBDD: an efficient BDD-based DQBF solver (Q2118347) (← links)
• Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
• Cooperating in video games? Impossible! Undecidability of team multiplayer games (Q2196560) (← links)
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
• Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315) (← links)
• On the computational consequences of independence in propositional logic (Q2500830) (← links)
• Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
• Dependency Schemes for DQBF (Q2818034) (← links)
• Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
• Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
• Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
• Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
• The Computational Complexity of Portal and Other 3D Video Games (Q3301006) (← links)
• Consensus Game Acceptors (Q3451093) (← links)
• Preprocessing for DQBF (Q3453223) (← links)
• Consensus Game Acceptors and Iterated Transductions (Q4640036) (← links)
• (Q5015279) (← links)
• The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
• Model Checking and Validity in Propositional and Modal Inclusion Logics (Q5111246) (← links)
• Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
• (Q5376655) (← links)
• A resolution proof system for dependency stochastic Boolean satisfiability (Q6050766) (← links)