Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
A note on non-complete problems in NPR
Authors:
Ben-David, S Meer, K Michaux, C
Citation:
S. Ben-david et al., A note on non-complete problems in NPR, J COMPLEX, 16(1), 2000, pp. 324-332
Counting problems over the reals
Authors:
Meer, K
Citation:
K. Meer, Counting problems over the reals, THEOR COMP, 242(1-2), 2000, pp. 41-58
Logics which capture complexity classes over the reals
Authors:
Cucker, F Meer, K
Citation:
F. Cucker et K. Meer, Logics which capture complexity classes over the reals, J SYMB LOG, 64(1), 1999, pp. 363-390
On the computational structure of the connected components of a hard problem
Authors:
Matamala, M Meer, K
Citation:
M. Matamala et K. Meer, On the computational structure of the connected components of a hard problem, INF PROCESS, 72(3-4), 1999, pp. 83-90
Risultati:
1-4
|