1888 search results - page 25 / 378 » Proof theory and computational analysis |
GC
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
SAC
2010
ACM
13 years 2 months ago
2010
ACM
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
OTM
2007
Springer
14 years 1 months ago
2007
Springer
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...