303 search results - page 27 / 61 » Discrete Mathematics for Computer Science, Some Notes |
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
TCS
1998
13 years 8 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
ICNP
1998
IEEE
14 years 3 days ago
1998
IEEE
Flow Theory is a rich, effective theory introduced in order to study real-time network protocols. It is based on discrete mathematics in which a flow of data is represented by an ...