2661 search results - page 73 / 533 » Quantum Complexity Classes |
122
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
The paper discusses computationally efficient NLMS and RLS algorithms for a broad class of nonlinear filters using periodic input sequences. The class comprises all nonlinear ...
144
click to vote
WIFT
1998
IEEE
15 years 5 months ago
1998
IEEE
The Unified Modeling Language (UML) is likely to become an important industry standard language for modelling object-oriented systems. However, its use as a precise analysis tool ...
93
Voted
ICMAS
1998
15 years 2 months ago
1998
Multi-agent models of language evolution usually involve agents giving names to internal independently constructed categories. We present an approach in which the creation of cate...
103
Voted
JSC
2010
14 years 11 months ago
2010
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...