Sciweavers

2479 search results - page 74 / 496
» Quantum complexity theory
Sort
View
ECAI
1998
Springer
15 years 10 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
15 years 6 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
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
The Theory of Quaternion Orthogonal Designs
Over the past several years, there has been a renewed interest in complex orthogonal designs for their application in space-time block coding. Motivated by the success of this app...
Jennifer Seberry, Ken Finlayson, Sarah Spence Adam...
SIGIR
2010
ACM
15 years 6 months ago
Estimating interference in the QPRP for subtopic retrieval
The Quantum Probability Ranking Principle (QPRP) has been recently proposed, and accounts for interdependent document relevance when ranking. However, to be instantiated, the QPRP...
Guido Zuccon, Leif Azzopardi, Claudia Hauff, Keith...
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
16 years 20 days ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib