787 search results - page 141 / 158 » Polynomial Constants are Decidable |
127
click to vote
COR
2006
15 years 4 months ago
2006
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
127
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
124
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
133
click to vote
ECOI
2007
15 years 3 months ago
2007
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
120
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...