13603 search results - page 402 / 2721 » On the Computational Complexity of Cut-Reduction |
215
click to vote
ICALP
2004
Springer
16 years 1 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
252
click to vote
TIME
2003
IEEE
16 years 26 days ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
179
click to vote
ICPR
2002
IEEE
16 years 16 days ago
2002
IEEE
We have constructed a simple and fast system to detect frontal human faces in complex environment. There are two main contributions of our work: 1) We use a fast image segmentatio...
199
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
200
click to vote
ESORICS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...