Cenny Wenner
Titel
Geciteerd door
Geciteerd door
Jaar
Complexity of Canadian traveler problem variants
D Fried, SE Shimony, A Benbassat, C Wenner
Theoretical Computer Science 487, 1-16, 2013
292013
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four
C Wenner
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
212012
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
P Austrin, R Manokaran, C Wenner
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
92013
Hardness results for the shortest path problem under partial observability
C Wenner
Institutionen för datavetenskap, Lunds universitet, 2009
52009
Parity is positively useless
C Wenner
APPROX/RANDOM 2014, 433-448, 2014
22014
Rule-based logical forms extraction
C Wenner
Proceedings of the 16th Nordic Conference of Computational Linguistics …, 2007
22007
Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
C Wenner
Numerical Analysis and Computer Science (NADA), Stockholm University, 2014
2014
Travelling in Unknown and Changing Graphs
C Wenner
2008
DATN09-Computational Geometry Lund University
C Wenner
2008
Extracting Logical Forms and Recognising Textual Entailment
C Wenner
Projektarbeten 2006, 75, 2007
2007
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–10