9842 search results - page 398 / 1969 » The Complexity of the Matching-Cut Problem |
144
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
157
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
The memory subsystem is a major contributor to the performance, power, and area of complex SoCs used in feature rich multimedia products. Hence, memory architecture of the embedded...
135
click to vote
EUROCRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
137
click to vote
ANTS
2006
Springer
15 years 8 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
129
click to vote
AAAI
1997
15 years 5 months ago
1997
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...