Du er her: Om instituttet » Personer og Lokationer » Personer » Kristoffer Arnsfelt Hansen » Publikationer

Kristoffer Arnsfelt Hansen

1 - 31 ud af 31Pr. side: 100
RSS feed af denne liste
Sortering: Udgivelsesår
  1. 2012
  2. Udgivet

    Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. / Eickmeyer, Kord ; Hansen, Kristoffer Arnsfelt ; Verbin, Elad.

    I: Electronic Colloquium on Computational Complexity, Vol. 19, Nr. 25, 2012.

    Publikation: Forskning - peer review › Tidsskriftartikel

  3. Udgivet

    Deterministic Graphical Games Revisited. / Andersson, Klas Olof Daniel ; Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Journal of Logic and Computation, Vol. 22, Nr. 2, 2012, s. 165-178.

    Publikation: Forskning - peer review › Tidsskriftartikel

  4. 2011
  5. Udgivet

    Exact algorithms for solving stochastic games. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal ; Lauritzen, Niels ; Miltersen, Peter Bro ; Tsigaridas, Elias.

    I: STOC'11: proceedings of the 43rd annual ACM symposium on Theory of computing. New York : Association for Computing Machinery, 2011. s. 205-214.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  6. Udgivet

    Learning Read-constant Polynomials of Constant Degree modulo Composites. / Chattopadhyay, Arkadev ; Gavaldá, Richard ; Hansen, Kristoffer Arnsfelt ; Thérien, Denis.

    I: Lecture Notes in Computer Science, Vol. 6651, 2011, s. 29-42.

    Publikation: Forskning - peer review › Konferenceartikel

  7. Udgivet

    Separation bounds for real roots of polynomial systems. / Hansen, Kristoffer Arnsfelt ; Koucky, Michal ; Lauritzen, Niels ; Tsigaridas, Elias.

    2011. Paper presented at MEGA 2011: Effective Methods in Algebraic Geometry, Stockholm, Sverige.

    Publikation: Forskning - peer review › Paper

  8. Udgivet

    The complexity of solving reachability games using value and strategy iteration. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Ibsen-Jensen, Rasmus.

    I: Lecture Notes in Computer Science, Vol. 6651, 2011, s. 77-90.

    Publikation: Forskning - peer review › Konferenceartikel

  9. Udgivet

    Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. / Gál, Anna ; Hansen, Kristoffer Arnsfelt ; Koucký, Michal ; Pudlák, Pavel ; Viola, Emanuele.

    I: Electronic Colloquium on Computational Complexity, Vol. 18, Nr. 150, 2011.

    Publikation: Forskning - peer review › Tidsskriftartikel

  10. 2010
  11. Udgivet

    Exact Threshold Circuits. / Hansen, Kristoffer Arnsfelt ; Podolskii, Vladimir V..

    I: I E E E Conference on Computational Complexity. Proceedings, 2010, s. 270-279.

    Publikation: Forskning - peer review › Konferenceartikel

  12. Udgivet

    The computational complexity of trembling hand perfection and other equilibrium refinements. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 6386, 2010, s. 198-209.

    Publikation: Forskning - peer review › Konferenceartikel

  13. Udgivet

    Weights of Exact Threshold Functions. / Babai, László ; Hansen, Kristoffer Arnsfelt ; Podolskii, Vladimir V. ; Sun, Xiaoming.

    I: Lecture Notes in Computer Science, Vol. 6281, 2010, s. 66-77.

    Publikation: Forskning - peer review › Konferenceartikel

  14. 2009
  15. Udgivet

    A New Characterization of ACC0 and Probabilistic CC0. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal.

    I: Computational Complexity, Vol. 19, Nr. 2, 2009, s. 211-234.

    Publikation: Forskning - peer review › Tidsskriftartikel

  16. Udgivet

    A new characterization of ACC0 and probabilistic CC0. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal.

    I: I E E E Conference on Computational Complexity. Proceedings, 2009, s. 27-34.

    Publikation: Forskning - peer review › Konferenceartikel

  17. Udgivet

    Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. / Hansen, Kristoffer Arnsfelt.

    I: Lecture Notes in Computer Science, Vol. 5675, 2009, s. 117-128.

    Publikation: Forskning - peer review › Konferenceartikel

  18. Udgivet

    Hilbert's thirteenth problem and circuit complexity. / Hansen, Kristoffer Arnsfelt ; Lachish, Oded ; Miltersen, Peter Bro.

    I: Lecture Notes in Computer Science, Vol. 5878, 2009, s. 153-162.

    Publikation: Forskning - peer review › Konferenceartikel

  19. Udgivet

    Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal ; Miltersen, Peter Bro.

    I: Symposium on Logic in Computer Science, 2009, s. 332-341.

    Publikation: Forskning - peer review › Konferenceartikel

  20. 2008
  21. Udgivet

    Approximability and Parameterized Complexity of Minmax Values. / Hansen, Kristoffer Arnsfelt ; Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 5385, 2008, s. 684-695.

    Publikation: Forskning - peer review › Konferenceartikel

  22. Udgivet

    Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. / Hansen, Kristoffer Arnsfelt.

    I: Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007. Proceedings. red. / Guohui Lin. Springer, 2008. s. 448-458 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  23. Udgivet

    Constant Width Planar Branching Programs Characterize ACC0 in Quasipolynomial Size. / Hansen, Kristoffer Arnsfelt.

    I: I E E E Conference on Computational Complexity. Proceedings, 2008, s. 92-99.

    Publikation: Forskning - peer review › Konferenceartikel

  24. Udgivet

    Deterministic Graphical Games Revisited. / Andersson, Daniel ; Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 5028, 2008, s. 1-10.

    Publikation: Forskning - peer review › Konferenceartikel

  25. 2007
  26. Udgivet

    Dynamic Matchings in Convex Bipartite Graphs. / Brodal, Gerth Stølting ; Georgiadis, Loukas ; Hansen, Kristoffer Arnsfelt ; Katriel, Irit.

    I: Proc. 32nd International Symposium on Mathematical Foundations of Computer Science. red. / Ludek Kucera ; Antonin Kucera. Springer, 2007. s. 406-417 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  27. Udgivet

    Finding Equilibria in Games of No Chance. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Computing and Combinatorics: Proc. of 13th Annual International Computing and Combinatorics Conference (COCOON 2007). red. / Guohui Lin. Springer, 2007. s. 274-284 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  28. Udgivet

    On Modular Counting with Polynomials. / Hansen, Kristoffer Arnsfelt.

    I: 21st Annual IEEE Conference on Computational Complexity (CCC'06). IEEE Computer Society Press, 2007. s. 202-212.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  29. 2006
  30. Udgivet

    Circuits on Cylinders. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Vinay, V.

    I: Computational Complexity, Vol. 15, Nr. 1, 2006, s. 62-81.

    Publikation: Forskning - peer review › Tidsskriftartikel

  31. Udgivet

    Constant Width and Constant Depth Computation. / Hansen, Kristoffer Arnsfelt.

    2006. 94 s. (DAIMI PhD Dissertation; PD-06-13).

    Publikation: Forskning › PhD. afhandling

  32. Udgivet

    Constant Width Planar Computation Characterizes ACC0. / Hansen, Kristoffer Arnsfelt.

    I: Theory of Computing Systems, Vol. 39, Nr. 1, 2006, s. 79-92.

    Publikation: Forskning - peer review › Konferenceartikel

  33. Udgivet

    Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. / Hansen, Kristoffer Arnsfelt.

    I: Electronic Colloquium on Computational Complexity, Vol. 13, Nr. 79, 2006.

    Publikation: Forskning - peer review › Tidsskriftartikel

  34. 2005
  35. Udgivet

    Lower Bounds for Circuits with Few Modular and Symmetric Gates. / Hansen, Kristoffer Arnsfelt ; Chattopadhyay, Arkadev.

    I: Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings. red. / Luís Caires ; Giuseppe F. Italiano ; Luís Monteiro ; Catuscia Palamidessi ; Moti Yung. Springer, 2005. s. 994-1005 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  36. 2004
  37. Udgivet

    Constant Width Planar Computation Characterizes ACC0. / Hansen, K.A..

    I: STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings. red. / Volker Diekert ; Michel Habib. Springer, 2004. s. 44-55 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  38. Udgivet

    Some Meet-in-the-middle Circuit Lower Bounds. / Hansen, K.A. ; Miltersen, P.B..

    I: Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings. red. / Jiri Fiala ; Vaclav Koubek ; Jan Kratochvil. Springer, 2004. s. 334-345 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  39. 2003
  40. Udgivet

    Circuits on Cylinders. / Hansen, K.A. ; Miltersen, P.B. ; Vinay, V..

    I: Fundamentals of Computation Theory. Springer Verlag. ISBN-rødder: 0-978, 2003. s. 171-182 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  41. 2002
  42. Udgivet

    Circuits on Cylinders. / Hansen, K.A. ; Miltersen, P.B. ; Vinay, V..

    I: Electronic Colloquium on Computational Complexity, Nr. TR02-066, 2002.

    Publikation: Forskning - peer review › Tidsskriftartikel