18 search results - page 1 / 4 » Formal Theories for Logspace Counting |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
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...
POPL
2004
ACM
14 years 5 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
JUCS
2008
13 years 5 months ago
2008
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...