16666 search results - page 31 / 3334 » Descriptive and Computational Complexity |
113
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
153
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
169
Voted
ICIAP
1999
ACM
15 years 7 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
138
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
122
Voted
CCE
2005
15 years 3 months ago
2005
Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetic...