2446 search results - page 146 / 490 » Choiceless Polynomial Time |
124
click to vote
ORL
1998
15 years 3 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
111
click to vote
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
107
click to vote
ISAAC
1993
Springer
15 years 8 months ago
1993
Springer
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
159
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
143
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...