4934 search results - page 150 / 987 » complexity 2008 |
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
143
click to vote
CLIMA
2008
15 years 5 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
127
click to vote
CDES
2008
15 years 5 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
154
click to vote
HIS
2008
15 years 5 months ago
2008
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...