1092 search results - page 86 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
IPPS
2006
IEEE
16 years 8 hour ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
176
click to vote
FCS
2009
15 years 3 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
147
click to vote
ICML
1996
IEEE
16 years 6 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
196
click to vote
DIS
2007
Springer
15 years 10 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
147
click to vote
TACAS
2007
Springer
16 years 2 days ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...