1772 search results - page 249 / 355 » Classifying Problems into Complexity Classes |
DEBS
2007
ACM
14 years 2 months ago
2007
ACM
Denial of Service (DoS) attacks continue to affect the availability of critical systems on the Internet. The existing DoS problem is enough to merit significant research dedicated...
JALC
2007
13 years 10 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CASCON
2006
13 years 11 months ago
2006
Coupling measures have important applications in software development and maintenance. They are used to reason about the structural complexity of software and have been shown to p...
CC
2007
Springer
13 years 10 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...