1998 search results - page 315 / 400 » Complexity of the Cover Polynomial |
113
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
115
click to vote
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
116
Voted
ALT
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
103
click to vote
ALT
2004
Springer
15 years 9 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
ICCD
2006
IEEE
15 years 9 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...