1379 search results - page 69 / 276 » The Complexity of the Annihilating Polynomial |
102
Voted
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
124
click to vote
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
109
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
113
Voted
CG
2002
Springer
15 years 12 days ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
IVC
2000
15 years 11 days ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...