Navegar

Colección

Datos Estadísticas

Lista de

Theorem proving
10
"Normal numbers and finite automata" (2013) Becher, V.; Heiber, P.A. Theoretical Computer Science. 477:109-116
"Random reals à la Chaitin with or without prefix-freeness" (2007) Becher, V.; Grigorieff, S. Theoretical Computer Science. 385(1-3):193-201
"Turing's unpublished algorithm for normal numbers" (2007) Becher, V.; Figueira, S.; Picchi, R. Theoretical Computer Science. 377(1-3):126-138
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"Improved explicit estimates on the number of solutions of equations over a finite field" (2006) Cafure, A.; Matera, G. Finite Fields and their Applications. 12(2):155-185
"Generalized polar varieties: Geometry and algorithms" (2005) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Festschrift for the 70th Birthday of Arnold Schonhage. 21(4):377-412
"Symmetry properties for the extremals of the Sobolev trace embedding" (2004) Bonder, J.F.; Dozo, E.L.; Rossi, J.D. Annales de l'Institut Henri Poincare (C) Analyse Non Lineaire. 21(6):795-805
"Recursion and topology on 2≤ω for possibly infinite computations" (2004) Becher, V.; Grigorieff, S. Theoretical Computer Science. 322(1 SPEC ISS):85-136
"Fractal block-coding: A functional approach for image and signal processing" (2002) Cabrelli, C.A.; Falsetti, M.C.; Molter, U.M. Computers and Mathematics with Applications. 44(8-9):1183-1200
"Monotone discrete Newton iterations and elimination" (1995) Milaszewicz, J.P. Computers and Mathematics with Applications. 30(1):79-90