182 search results - page 9 / 37 » A Theory of Strict P-completeness |
ACS
2004
13 years 7 months ago
2004
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The descr...
ASIAN
1998
Springer
13 years 11 months ago
1998
Springer
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
LICS
1999
IEEE
13 years 12 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...
APAL
2008
13 years 7 months ago
2008
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...