155 search results - page 16 / 31 » Bounded Arithmetic and Descriptive Complexity |
AIPS
2006
13 years 8 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
ANTS
2004
Springer
13 years 11 months ago
2004
Springer
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
JACM
2010
13 years 5 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
ICSE
2007
IEEE-ACM
14 years 7 months ago
2007
IEEE-ACM
Many architecture description languages (ADLs) have been proposed to model, analyze, configure, and deploy complex software systems. To face this diversity, extensible ADLs (or AD...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...