2233 search results - page 29 / 447 » On the Complexity of Theory Curbing |
112
click to vote
ECAI
1998
Springer
15 years 6 months ago
1998
Springer
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...
SIAMMAX
2010
14 years 8 months ago
2010
Abstract. We discuss the notion of irreducible block Schur decomposition of a complex square matrix and show how such a decomposition provides information about singularities in th...
117
Voted
SIAMCOMP
2000
15 years 1 months ago
2000
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...
77
Voted
TSP
2008
15 years 1 months ago
2008
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...
113
click to vote
ISCC
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...