9842 search results - page 359 / 1969 » Problem complexity |
174
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
208
click to vote
HIS
2008
15 years 8 months ago
2008
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
144
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
175
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
190
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...