2766 search results - page 228 / 554 » Algorithms for trigonometric polynomials |
151
click to vote
ACTA
1998
15 years 5 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
145
click to vote
IPL
1998
15 years 5 months ago
1998
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
144
click to vote
TCS
2011
15 years 8 days ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
180
Voted
DLOG
2011
14 years 8 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
141
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...