Cs-Cc
On the Computational Complexity of Stochastic Controller Optimization in POMDPs
Intuitionistic implication makes model checking hard
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Complexity of Metric Dimension on Planar Graphs
Applications of Discrepancy Theory in Multiobjective Approximation
Approximating the Permanent with Fractional Belief Propagation
Graph Expansion and Communication Costs of Fast Matrix Multiplication
A Market for Air Traffic Flow Management
Outlier detection in default logics: the tractability/intractability frontier
The First-Order Theory of Ground Tree Rewrite Graphs
On quantum interactive proofs with short messages
Solving Limited Memory Influence Diagrams
Optimal accessing and non-accessing structures for graph protocols
A Linear-Optical Proof that the Permanent is #P-Hard
The Complexity of Nash Equilibria in Limit-Average Games
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Roulette-wheel selection via stochastic acceptance
Local Correction of Juntas
$2^{log^{1-eps} n}$ Hardness for Closest Vector Problem with Preprocessing
The Complexity of the Empire Colouring Problem
Automatas celulares elementales aplicados a la encriptacion de datos
