|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 35 publication records. Showing 35 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin |
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Deterministic Graphical Games Revisited. |
J. Log. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas |
Exact Algorithms for Solving Stochastic Games |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien |
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas |
Exact algorithms for solving stochastic games: extended abstract. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Michal Koucký |
A New Characterization of ACC0 and Probabilistic CC0. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
The complexity of solving reachability games using value and strategy iteration |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun |
Weights of Exact Threshold Functions. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. |
SAGT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii |
Exact Threshold Circuits. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Exact Threshold Functions, Boolean Circuits, Threshold Functions |
| 1 | Kristoffer Arnsfelt Hansen |
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen |
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen |
Hilbert's Thirteenth Problem and Circuit Complexity. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Michal Koucký |
A New Characterization of ACC0 and Probabilistic CC0. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Approximability and parameterized complexity of minmax values |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Approximability and Parameterized Complexity of Minmax Values. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Constant Width, Circuits, Planarity, Branching Programs |
| 1 | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Deterministic Graphical Games Revisited. |
CiE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Simple Recursive Games |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
Dynamic Matchings in Convex Bipartite Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Finding Equilibria in Games of No Chance. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |
Circuits on cylinders. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q70 |
| 1 | Kristoffer Arnsfelt Hansen |
Constant Width Planar Computation Characterizes ACC0. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
On Modular Counting with Polynomials. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen |
Lower Bounds for Circuits with Few Modular and Symmetric Gates. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen |
Some Meet-in-the-Middle Circuit Lower Bounds. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
Constant Width Planar Computation Characterizes ACC0. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen |
Constant width planar computation characterizes ACC0 |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |
Circuits on Cylinders. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |
Circuits on Cylinders |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
Displaying result #1 - #35 of 35 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")