477 search results - page 79 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
DBPL
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
TWC
2008
13 years 7 months ago
2008
In a wireless multiple-input multiple-output (MIMO) system, transmit antenna selection is an effective means of achieving good performance with low complexity. We consider spatial ...