2430 search results - page 81 / 486 » Computing Tutte Polynomials |
122
click to vote
CRYPTO
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
116
Voted
ALENEX
2004
15 years 4 months ago
2004
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
109
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
119
click to vote
ADG
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
111
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...