92 search results - page 15 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
STACS
2001
Springer
13 years 11 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
MFCS
2005
Springer
14 years 27 days ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ...
IMSCCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Ad hoc networks face the problem of improving networks’ capacity and scalability. The scalability problem can be properly solved through physical hierarchy networking. In this p...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
FOCS
2002
IEEE
14 years 10 days ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...