7106 search results - page 202 / 1422 » Restricted Complexity, General Complexity |
204
click to vote
GMP
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
148
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
121
click to vote
IPL
2006
15 years 3 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
144
click to vote
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
178
Voted
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...