2354 search results - page 127 / 471 » A Common-Sense Theory of Time |
STOC
1996
ACM
14 years 11 days ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
DFG
1992
Springer
14 years 9 days ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
BIRTHDAY
2006
Springer
13 years 12 months ago
2006
Springer
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capt...
DAGSTUHL
2007
13 years 9 months ago
2007
Semantic structures for belief revision are proposed. We start with one-stage revision structures that generalize the notion of choice function from rational choice theory. A corr...
ECCC
2007
13 years 8 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...