1772 search results - page 242 / 355 » Classifying Problems into Complexity Classes |
136
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
ISMVL
2006
IEEE
15 years 6 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
87
Voted
SAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
69
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
91
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...