1193 search results - page 55 / 239 » A primer of simple theories |
INFORMATICALT
2000
14 years 11 months ago
2000
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
COMBINATORICS
1998
14 years 11 months ago
1998
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonne...
110
click to vote
SETA
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
122
click to vote
MST
2011
14 years 6 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
FM
2003
Springer
15 years 5 months ago
2003
Springer
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...