7106 search results - page 183 / 1422 » Restricted Complexity, General Complexity |
154
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...
123
Voted
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
115
click to vote
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
142
Voted
PEPM
1994
ACM
15 years 7 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
110
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...