#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1977

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Laura Giarré, Boleslaw Z. Kacewicz, Mario Milanese
- Automatica
- 1997

- Boleslaw Z. Kacewicz
- J. Complexity
- 2004

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper we deal with the randomized… (More)

- Boleslaw Z. Kacewicz
- J. Complexity
- 2006

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small… (More)

- Boleslaw Z. Kacewicz
- J. Complexity
- 2005

We study the problem, initiated in [8], of finding randomized and quantum complexity of initial-value problems. We showed in [8] that a speed-up in both settings over the worst-case deterministic complexity is possible. In the present paper we prove, by defining new algorithms, that further improvement in upper bounds on the randomized and quantum… (More)

- Boleslaw Z. Kacewicz, Mario Milanese, Antonio Vicino
- J. Complexity
- 1988

- Boleslaw Z. Kacewicz
- J. Complexity
- 1990

We deal with the solution of systems z’(x) = f(x, z(x)), x E [O, 11, z(0) = n, where the function f: [0, l] x UP + IWI has r continuous bounded partial derivatives. We assume that available information about the problem consists of evaluations of n linear functionals at f. If an adaptive choice of these functionals is allowed (which is suitable for… (More)

- Boleslaw Z. Kacewicz
- Automatica
- 1999

- Boleslaw Z. Kacewicz
- J. Complexity
- 2004

- Andrea Garulli, Boleslaw Z. Kacewicz, Antonio Vicino, Giovanni Zappa
- IEEE Trans. Automat. Contr.
- 2000

Restricted complexity estimation is a major topic in control-oriented identi cation. Conditional algorithms are used to identify linear nite dimensional models of complex systems, the aim being to minimize the worst-case identi cation error. High computational complexity of optimal solutions suggests to employ suboptimal estimation algorithms. This paper… (More)

- Boleslaw Z. Kacewicz
- J. Complexity
- 1987

We survey some recent optimality results for the numerical solution of initial value problems for ODE. We assume that information used by an algorithm about a right-hand-side function is partial. Two settings of information-based complexity are considered: the worst case and asymptotic. Upper and lower bounds on the error are presented for three types of… (More)