8196 search results - page 78 / 1640 » Computational Modeling and Complexity Science |
FOCS
2002
IEEE
15 years 2 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...
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
CONCURRENCY
2006
14 years 9 months ago
2006
: The next generation of scientific experiments and studies, popularly called e-Science, is carried out by large collaborations of researchers distributed around the world engaged ...
STACS
2010
Springer
15 years 1 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
170
click to vote
SSDBM
2011
IEEE
14 years 1 months ago
2011
IEEE
Database technology remains underused in science, especially in the long tail the small labs and individual researchers that collectively produce the majority of scienti c output...