1686 search results - page 2 / 338 » Programs as polygraphs: computability and complexity |
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
MP
2006
13 years 5 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
JFP
2000
13 years 5 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Book
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"