Result 1 to 20 of 377 total
Nondeterministic query algorithms. (English)
J. UCS 17, No. 6, 859-873, electronic only (2011).
1
Randomized algorithms and complexity theory. (English)
J. UCS 12, No. 6, 746-761, electronic only (2006).
2
Improving deterministic and randomized exponential-time algorithms for the satisfiability, the colorability, and the domatic number problem. (English)
J. UCS 12, No. 6, 725-745, electronic only (2006).
3
Testing membership in formal languages implicitly represented by Boolean functions. (English)
J. UCS 12, No. 6, 710-724, electronic only (2006).
4
Completeness in the Boolean hierarchy: exact-four-colorability, minimal graph uncolorability, and exact domatic number problems - a survey. (English)
J. UCS 12, No. 5, 551-578, electronic only (2006).
5
The tiling of the hyperbolic 4d space by the 120-cell is combinatoric. (English)
J. UCS 10, No. 9, 1212-1238, electronic only (2004).
6
An efficient family of p systems for packing items into bins. (English)
J. UCS 10, No. 5, 650-670, electronic only (2004).
7
On the computational complexity of upper total domination. (English)
Discrete Appl. Math. 136, No.1, 13-22 (2004).
8
Fibonacci type coding for the regular rectangular tilings of the hyperbolic plane. (English)
J. UCS 9, No. 5, 398-422, electronic only (2003).
9
Relativizing function classes. (English)
J. UCS 9, No. 1, 34-50, electronic only (2003).
10
On the autoreducibility of random sequences. (English)
SIAM J. Comput. 32, No.6, 1542-1569 (2003).
11
On easy and hard hereditary classes of graphs with respect to the independent set problem. (English)
Discrete Appl. Math. 132, No.1-3, 17-26 (2003).
12
Complexity, initial condition sensitivity, dimension and weak chaos in dynamical systems. (English)
Nonlinearity 16, No.4, 1219-1238 (2003).
13
Differential approximation for some routing problems. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 277-288 (2003).
14
Improving customer proximity to railway stations. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 264-276 (2003).
15
Nearly bounded error probabilistic sets. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 213-226 (2003).
16
The complexity of detecting fixed-density clusters. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 201-212 (2003).
17
Approximation hardness for small occurrence instances of NP-hard problems. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 152-164 (2003).
18
Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 108-119 (2003).
19
Maximizing the guarded boundary of an art gallery is APX-complete. (English)
Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 24-35 (2003).
20
Result 1 to 20 of 377 total
Start
Contact
Print
General Help
