5964 search results - page 412 / 1193 » A theory of speculative computation |
182
click to vote
MFCS
2004
Springer
16 years 29 days ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
214
click to vote
ICALP
2003
Springer
16 years 24 days ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
212
click to vote
TPHOL
2002
IEEE
16 years 15 days ago
2002
IEEE
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
200
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
244
click to vote
DFG
1992
Springer
15 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...