15033 search results - page 194 / 3007 » Complexity Theory and Algorithms |
173
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
123
click to vote
IJIS
2008
15 years 4 months ago
2008
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
120
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
158
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
173
click to vote
MST
2011
14 years 11 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...