2060 search results - page 182 / 412 » Some Applications of Coding Theory in Computational Complexi... |
106
click to vote
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
GG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
HPDC
1996
IEEE
15 years 2 months ago
1996
IEEE
' The coming of giga-bit networks makes possible the realization ofa single nationwide virtual computer comprised of a variety of geographically distributed highpe6ormance mac...
FUIN
2010
14 years 8 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...