The following pages link to Kristoffer Arnsfelt Hansen (Q626673):
Displayed 45 items.
- A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\) (Q626674) (← links)
- Absorbing games with a clock and two bits of memory (Q2031198) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Constant width planar computation characterizes ACC\(^{0}\) (Q2432526) (← links)
- Patience of matrix games (Q2444536) (← links)
- Circuits on cylinders (Q2506165) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- The Big Match in Small Space (Q2819448) (← links)
- Polynomial Threshold Functions and Boolean Threshold Circuits (Q2849939) (← links)
- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth (Q2922620) (← links)
- The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form (Q2938661) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Computation of Stackelberg Equilibria of Finite Sequential Games (Q3460789) (← links)
- Dynamic Matchings in Convex Bipartite Graphs (Q3525588) (← links)
- Weights of Exact Threshold Functions (Q3586073) (← links)
- Finding Equilibria in Games of No Chance (Q3608853) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- Hilbert’s Thirteenth Problem and Circuit Complexity (Q3652201) (← links)
- Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (Q4910937) (← links)
- (Q5020524) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- (Q5089213) (← links)
- (Q5111270) (← links)
- STACS 2004 (Q5309686) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311109) (← links)
- Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates (Q5346309) (← links)
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (Q5415496) (← links)
- Exact algorithms for solving stochastic games (Q5419090) (← links)
- Automata, Languages and Programming (Q5716847) (← links)
- Deterministic Graphical Games Revisited (Q5891525) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5894694) (← links)
- Deterministic Graphical Games Revisited (Q5900106) (← links)
- Fundamentals of Computation Theory (Q5900795) (← links)
- On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
- On the computational complexity of decision problems about multi-player Nash equilibria (Q5919366) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- The Big Match with a Clock and a Bit of Memory (Q6199247) (← links)
- A Stay-in-a-Set Game without a Stationary Equilibrium (Q6316335) (← links)