2576 search results - page 119 / 516 » The Complexity of Zero Knowledge |
150
click to vote
TCS
2010
14 years 11 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
140
click to vote
CORR
2012
Springer
14 years 7 days ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
125
click to vote
JAR
2007
15 years 4 months ago
2007
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
141
click to vote
AIIA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Adaptation is one of the most problematic steps in the design and development of Case Based Reasoning (CBR) systems, as it may require considerable domain knowledge and i...
122
Voted
AI
2004
Springer
15 years 10 months ago
2004
Springer
The fitness function of an evolutionary algorithm is one of the few possible spots where application knowledge can be made available to the algorithm. But the representation and u...