835 search results - page 45 / 167 » Characterizing rosy theories |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
AMAST
2006
Springer
15 years 3 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
IEEEICCI
2005
IEEE
15 years 5 months ago
2005
IEEE
The paper presents a case study that investigates programmer learning during incremental program development. Dialog based protocol and protocol analysis are used to explore the l...
GW
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents gesture analysis under the scope of motor control theory. Following the motor program view, some studies have revealed a number of invariant features that chara...
AML
2008
14 years 12 months ago
2008
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...