3897 search results - page 54 / 780 » complexity 2010 |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
SERVICES
2010
13 years 9 months ago
2010
Abstract--Exchanging structured business documents is inevitable for successful collaboration in electronic commerce. A prerequisite, for fostering the interoperability between bus...
ENTCS
2006
13 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
JITECH
2010
13 years 6 months ago
2010
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...