76 search results - page 7 / 16 » On the Complexity of the Sperner Lemma |
AML
2007
13 years 8 months ago
2007
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
LLL
1999
Springer
14 years 6 days ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
COLING
2008
13 years 9 months ago
2008
This work presents the development of a system that detects incorrect uses of complex postpositions in Basque, an agglutinative language. Error detection in complex postpositions ...
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....