1431 search results - page 27 / 287 » The complexity of random ordered structures |
78
Voted
FSTTCS
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
117
click to vote
MOC
1998
14 years 9 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
NN
2007
Springer
15 years 3 months ago
2007
Springer
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
102
click to vote
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
90
Voted
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...