Sciweavers

1007 search results - page 8 / 202
» The Complexity of Futile Questioning
Sort
View
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 7 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
PVM
2007
Springer
14 years 1 months ago
A Virtual Test Environment for MPI Development: Quick Answers to Many Small Questions
Abstract. MPI implementations are faced with growingly complex network configurations containing multiple network interfaces per node, NAT, or dual stacks. To implement handling l...
Wolfgang Schnerring, Christian Kauhaus, Dietmar Fe...
ECIR
2009
Springer
14 years 4 months ago
A Framework of Evaluation for Question-Answering Systems
Evaluating complex system is a complex task. Evaluation campaigns are organized each year to test different systems on global results, but they do not evaluate the relevance of th...
Sarra El Ayari, Brigitte Grau
CORR
2000
Springer
95views Education» more  CORR 2000»
13 years 7 months ago
One Complexity Theorist's View of Quantum Computing
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
Lance Fortnow
IWPEC
2010
Springer
13 years 5 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter