72 search results - page 2 / 15 » On a syntactic approximation to logics that capture complexi... |
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
EUSFLAT
2009
13 years 3 months ago
2009
Neural Networks (NN), Type-1 Fuzzy Logic Systems (T1FLS) and Interval Type-2 Fuzzy Logic Systems (IT2FLS) are universal approximators, they can approximate any non-linear function....
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
MST
2007
13 years 4 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...