7106 search results - page 171 / 1422 » Restricted Complexity, General Complexity |
126
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
160
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
156
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
146
click to vote
HYBRID
1997
Springer
15 years 7 months ago
1997
Springer
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
144
Voted
JCSS
2008
15 years 3 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...