8196 search results - page 123 / 1640 » Computational Modeling and Complexity Science |
100
click to vote
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
102
click to vote
TCS
2010
14 years 4 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
STACS
1994
Springer
15 years 2 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
PPOPP
2003
ACM
15 years 3 months ago
2003
ACM
Because of increasing hardware and software complexity, the running time of many computational science applications is now more than the mean-time-to-failure of highpeformance com...