2233 search results - page 36 / 447 » On the Complexity of Theory Curbing |
138
click to vote
SIAMDM
2008
15 years 1 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
115
click to vote
JACM
2002
15 years 1 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
136
click to vote
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
106
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
119
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...