Navegar

Colección

Datos Estadísticas

Lista de

Computational complexity
64
"Degree-greedy algorithms on large random graphs" (2019) Bermolen, P.; Jonckheere, M.; Larroca, F.; Saenz, M. 36th IFIP Performance Conference 2018. 46(3):27-32
"On the Computational Complexity of Information Hiding" (2018) Paredes, A.R. Electronic Notes in Theoretical Computer Science. 339:135-146
"Approximating weighted neighborhood independent sets" (2018) Lin, M.C.; Mestre, J.; Vasiliev, S. Information Processing Letters. 130:11-15
"On the Davenport–Mahler bound" (2017) Escorcielo, P.; Perrucci, D. Journal of Complexity. 41:72-81
"Robust bell inequalities from communication complexity" (2016) Laplante, S.;Laurière, M.;Nolin, A. (...)Broadbent A. 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016. 61
"On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size" (2015) Lin, M.C.; Mizrahi, M.J. Discrete Applied Mathematics. 197:53-58
"A parsing approach to SAT" (2014) Castano, J.M. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8864:3-14
"Intrinsic complexity estimates in polynomial optimization" (2014) Bank, B.; Giusti, M.; Heintz, J.; Safey El Din, M. Journal of Complexity. 30(4):430-443
"A note on the Cornaz-Jost transformation to solve the graph coloring problem" (2013) Bonomo, F.; Giandomenico, M.; Rossi, F. Information Processing Letters. 113(18):649-652
"A note on the Cornaz-Jost transformation to solve the graph coloring problem" (2013) Bonomo, F.; Giandomenico, M.; Rossi, F. Information Processing Letters. 113(18):649-652
"On coloring problems with local constraints" (2012) Bonomo, F.; Faenza, Y.; Oriolo, G. Discrete Mathematics. 312(12-13):2027-2039
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"Evaluating geometric queries using few arithmetic operations" (2012) Grimson, R.; Heintz, J.; Kuijpers, B. Applicable Algebra in Engineering, Communications and Computing. 23(3-4):179-193
"Evaluating geometric queries using few arithmetic operations" (2012) Grimson, R.; Heintz, J.; Kuijpers, B. Applicable Algebra in Engineering, Communications and Computing. 23(3-4):179-193
"A dataflow analysis to improve SAT-based bounded program verification" (2011) Cuervo Parrino, B.; Galeotti, J.P.; Garbervetsky, D.; Frias, M.F. 9th International Conference on Software Engineering and Formal Methods, SEFM 2011. 7041 LNCS:138-154
"Using logic in the generation of referring expressions" (2011) Areces, C.; Figueira, S.; Gorín, D. 6th International Conference on Logical Aspects of Computational Linguistics, LACL 2011. 6736 LNAI:17-32
"Efficient evaluation of specific queries in constraint databases" (2011) GrimsOn, R.; Heintz, J.; Kuijpers, B. Information Processing Letters. 111(19):941-944
"On the geometry of polar varieties" (2010) Bank, B.;Giusti, M.;Heintz, J. (...)Schost, E. Applicable Algebra in Engineering, Communications and Computing. 21(1):33-83
"On coloring problems with local constraints" (2009) Bonomo, F.; Faenza, Y.; Oriolo, G. Electronic Notes in Discrete Mathematics. 35(C):215-220
"Shakespeare and other English Renaissance authors as characterized by Information Theory complexity quantifiers" (2009) Rosso, O.A.; Craig, H.; Moscato, P. Physica A: Statistical Mechanics and its Applications. 388(6):916-926
"On the intrinsic complexity of point finding in real singular hypersurfaces" (2009) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Information Processing Letters. 109(19):1141-1144
"On the intrinsic complexity of point finding in real singular hypersurfaces" (2009) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Information Processing Letters. 109(19):1141-1144
"NP-hardness of the recognition of coordinated graphs" (2009) Soulignac, F.J.; Sueiro, G. Annals of Operations Research. 169(1):17-34
"A column generation algorithm for choice-based network revenue management" (2009) Bront, J.J.M.; Méndez-Díaz, I.; Vulcano, G. Operations Research. 57(3):769-784
"Exploring the complexity boundary between coloring and list-coloring" (2009) Bonomo, F.; Durán, G.; Marenco, J. Annals of Operations Research. 169(1):3-16
"Real roots of univariate polynomials and straight line programs" (2007) Perrucci, D.; Sabia, J. Journal of Discrete Algorithms. 5(3):471-478
"Characterization of Gaussian self-similar stochastic processes using wavelet-based informational tools" (2007) Zunino, L.;Pérez, D.G.;Martín, M.T. (...)Rosso, O.A. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 75(2)
"Faster recognition of clique-Helly and hereditary clique-Helly graphs" (2007) Lin, M.C.; Szwarcfiter, J.L. Information Processing Letters. 103(1):40-43
"Distinguishing noise from chaos" (2007) Rosso, O.A.;Larrondo, H.A.;Martin, M.T. (...)Fuentes, M.A. Physical Review Letters. 99(15)
"Generalized statistical complexity measures: Geometrical and analytical properties" (2006) Martin, M.T.; Plastino, A.; Rosso, O.A. Physica A: Statistical Mechanics and its Applications. 369(2):439-462
"Fork algebras as a sufficiently rich universal institution" (2006) Pombo, C.G.L.; Frias, M.F. 11th International Conference on Algebraic Methodology and Software Technology, AMAST 2006. 4019 LNCS:235-247
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"Classical computability and fuzzy Turing machines" (2006) Bedregal, B.R.C.; Figueira, S. LATIN 2006: Theoretical Informatics - 7th Latin American Symposium. 3887 LNCS:154-165
"Characterizations and linear time recognition of helly circular-arc graphs" (2006) Lin, M.C.; Szwarcfiter, J.L. 12th Annual International Conference on Computing and Combinatorics, COCOON 2006. 4112 LNCS:73-82
"Lowness properties and approximations of the jump" (2006) Figueira, S.; Nies, A.; Stephan, F. Electronic Notes in Theoretical Computer Science. 143(SPEC ISS):45-57
"An algorithm for the computation of the radical of an ideal" (2006) Laplagne, S. International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. 2006:191-195
"Exploring the complexity boundary between coloring and list-coloring" (2006) Bonomo, F.; Durán, G.; Marenco, J. Electronic Notes in Discrete Mathematics. 25(SPEC ISS):41-47
"Algorithms for clique-independent sets on subclasses of circular-arc graphs" (2006) Durán, G.; Lin, M.C.; Mera, S.; Szwarcfiter, J.L. Discrete Applied Mathematics. 154(13 SPEC ISS):1783-1790
"Simple data-driven models of intracellular calcium dynamics with predictive power" (2006) Ventura, A.C.; Bruno, L.; Dawson, S.P. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 74(1)
"On the complexity of the resolvent representation of some prime differential ideals" (2006) D'Alfonso, L.; Jeronimo, G.; Solernó, P. Journal of Complexity. 22(3):396-430
"Evidence of self-organization in brain electrical activity using wavelet-based informational tools" (2005) Rosso, O.A.; Martin, M.T.; Plastino, A. Physica A: Statistical Mechanics and its Applications. 347:444-464
"Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study" (2005) De Leo, M.; Dratman, E.; Matera, G. Festschrift for the 70th Birthday of Arnold Schonhage. 21(4):502-531
"Statistical complexity measure of pseudorandom bit generators" (2005) González, C.M.; Larrondo, H.A.; Rosso, O.A. Physica A: Statistical Mechanics and its Applications. 354(1-4):281-300
"DynAlloy: Upgrading alloy with actions" (2005) Frias, M.F.; Galeotti, J.P.; Pombo, C.G.L.; Aguirre, N.M. 27th International Conference on Software Engineering, ICSE05:442-450
"Ab initio global optimization of the structures of SinH, n=4-10, using parallel genetic algorithms" (2005) Oña, O.;Bazterra, V.E.;Caputo, M.C. (...)Facelli, J.C. Physical Review A - Atomic, Molecular, and Optical Physics. 72(5)
"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
"Intensive statistical complexity measure of pseudorandom number generators" (2005) Larrondo, H.A.;González, C.M.;Martín, M.T. (...)Rosso, O.A. Nonequilibrium Statistical Mechanics and Nonlinear Physics (MEDYFINOL'04). 356(1):133-138
"The Computational Complexity of the Chow Form" (2004) Jeronimo, G.; Krick, T.; Sabia, J.; Sombra, M. Foundations of Computational Mathematics. 4(1):41-117
"Helium atom in a box: Doubly excited levels within the S-wave model" (2004) Mitnik, D.M. Physical Review A - Atomic, Molecular, and Optical Physics. 70(2):022703-1-0227031-1
"Generalized polar varieties and an efficient real elimination procedure" (2004) Bank, B.; Giusti, M.; Heintz, J.; Pardo, L.M. Kybernetika. 40(5):519-550
"Computational complexity of edge modification problems in different classes of graphs" (2004) Burzyn, P.; Bonomo, F.; Durán, G. Electronic Notes in Discrete Mathematics. 18:41-46
"Testing integrability with a single bit of quantum information" (2003) Poulin, D.; Laflamme, R.; Milburn, G.J.; Paz, J.P. Physical Review A - Atomic, Molecular, and Optical Physics. 68(2):223021-223026
"Self-Clique Graphs and Matrix Permutations" (2003) Bondy, A.; Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Journal of Graph Theory. 44(3):178-192
"Self-Clique Graphs and Matrix Permutations" (2003) Bondy, A.; Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Journal of Graph Theory. 44(3):178-192
"UBA-Sot: An approach to control and team strategy in robot soccer" (2003) Santos, J.M.;Scolnik, H.D.;Laplagne, I. (...)Castelo, C. International Journal of Control, Automation and Systems. 1(1):149-155
"The hardness of polynomial equation solving" (2003) Castro, D.;Giusti, M.;Heintz, J. (...)Pardo, L.M. Foundations of Computational Mathematics. 3(4):347-420
"Solving differential equations with unsupervised neural networks" (2003) Parisi, D.R.; Mariani, M.C.; Laborde, M.A. Chemical Engineering and Processing: Process Intensification. 42(8-9):715-721
"Another example of higher order randomness" (2002) Becher, V.; Chaitin, G. Fundamenta Informaticae. 51(4):325-338
"On the time-space complexity of geometric elimination procedures" (2001) Heintz, J.; Matera, G.; Waissbein, A. Applicable Algebra in Engineering, Communications and Computing. 11(4):239-296
"Numerical evaluation of Appell's F1 hypergeometric function" (2001) Colavecchia, F.D.; Gasaneo, G.; Miraglia, J.E. Computer Physics Communications. 138(1):29-43
"A linear time algorithm for a matching problem on the circle" (1998) Cabrelli, C.A.; Molter, U.M. Information Processing Letters. 66(3):161-164
"Lattices due to increasing low energy relational processes" (1997) Leguizamón, C.A.; Zaretzky, A.N. Mathematical and Computer Modelling. 25(11):75-81
"Complexity bounds in elimination theory - A survey" (1996) Solernó, P. Mathematics and Computers in Simulation. 42(4-6):429-438