1888 search results - page 87 / 378 » Proof theory and computational analysis |
88
Voted
EP
1998
Springer
15 years 4 months ago
1998
Springer
This article presents mathematical tools for computer-generated ornamental patterns, with a particular attention payed to Islamic patterns. The article shows how, starting from a p...
98
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
99
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
105
click to vote
SIAMCOMP
2002
15 years 4 days ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
109
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...