1998 search results - page 153 / 400 » Complexity of the Cover Polynomial |
167
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
145
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
This article formalises the dual problem to model-based diagnosis (MBD), i.e., generating tests to isolate multiple simultaneous faults. Using a standard propositional MBD framewo...
134
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
164
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
151
click to vote
GLOBECOM
2006
IEEE
16 years 16 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...