7106 search results - page 75 / 1422 » Restricted Complexity, General Complexity |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
ICIP
2000
IEEE
14 years 4 days ago
2000
IEEE
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...