680 search results - page 48 / 136 » Complexity of Strict Implication |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
TRUST
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Supercomputers are increasingly complex systems merging conventional microprocessors with system on a chip level designs that provide the network interface and router. At Sandia N...
IFIP
2000
Springer
13 years 11 months ago
2000
Springer
Information systems research is concerned with complex imbroglios of human and non-human components. As researchers, we need ways to represent the intricacies of the different sta...