Παρακολούθηση
Jose L. Balcazar
Jose L. Balcazar
Professor, Computer Science, Universitat Politècnica de Catalunya
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα upc.edu
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Structural complexity 2
JL Balcázar, J Díaz, J Gabarró
Springer-Verlag New York, Inc., 1990
1718*1990
Structural complexity 2
JL Balcázar, J Díaz, J Gabarró
Springer-Verlag New York, Inc., 1990
1663*1990
Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science
JL Balcázar, J Dıaz, J Gabarró
Springer Verlag, Berlin, 1988
1641*1988
Optimal distance networks of low degree for parallel computers
R Beivide, E Herrada, JL Balcazar, A Arruabarrena
IEEE Transactions on Computers 40 (10), 1109-1124, 1991
171*1991
Provably fast training algorithms for support vector machines
JL Balcázar, Y Dai, J Tanaka, O Watanabe
Theory of Computing Systems 42, 568-595, 2008
155*2008
Bi-immune sets for complexity classes
JL Balcázar, U Schöning
Mathematical Systems Theory 18 (1), 1-10, 1985
1411985
The polynomial-time hierarchy and sparse oracles
JL Balcázar, RV Book, U Schöning
Journal of the ACM (JACM) 33 (3), 603-617, 1986
1221986
Deciding bisimilarity isP-complete
J Balcázar, J Gabarro, M Santha
Formal aspects of computing 4, 638-648, 1992
1211992
Algorithms for learning finite automata from queries: A unified view
JL Balcázar, J Díaz, R Gavalda, O Watanabe
Advances in Algorithms, Languages, and Complexity, 53-72, 1997
1071997
Computational power of neural networks: A characterization in terms of Kolmogorov complexity
JL Balcázar, R Gavalda, HT Siegelmann
IEEE Transactions on Information Theory 43 (4), 1175-1183, 1997
1041997
Self-reducibility
JL Balcázar
Journal of Computer and System Sciences 41 (3), 367-388, 1990
1031990
Sparse sets, lowness and highness
JL Balcázar, RV Book, U Schöning
SIAM Journal on Computing 15 (3), 739-747, 1986
991986
Sets with small generalized Kolmogorov complexity
JL Balcázar, RV Book
Acta Informatica 23 (6), 679-688, 1986
89*1986
The complexity of algorithmic problems on succinct instances
JL Balcázar, A Lozano, J Torán
Computer science: research and applications, 351-377, 1992
811992
Redundancy, deduction schemes, and minimum-size bases for association rules
JL Balcázar
Logical Methods in Computer Science 6 (2 (arXiv:1002.4286)), 2010
73*2010
The complexity of graph problems for succinctly represented graphs
A Lozano, JL Balcázar
International Workshop on Graph-Theoretic Concepts in Computer Science, 277-286, 1989
691989
A first-order isomorphism theorem
E Allender, J Balcázar, N Immerman
SIAM Journal on Computing 26 (2), 557-567, 1997
641997
Mining frequent closed rooted trees
JL Balcázar, A Bifet, A Lozano
Machine Learning 78, 1-33, 2010
51*2010
Construction and learnability of canonical Horn formulas
M Arias, JL Balcázar
Machine Learning 85 (3), 273-297, 2011
45*2011
Logarithmic advice classes
JL Balcázar, U Schöning
Theoretical Computer Science 99 (2), 279-290, 1992
451992
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20