Probabilistic analysis of two euclidean location problems
Problems remaining NP-complete for sparse or dense graphs
For each fixed pair α,c > 0 let INDEPENDENT SET () and INDEPENDENT SET () be the problem INDEPENDENT SET restricted to graphs on n vertices with or edges, respectively. Analogously, HAMILTONIAN CIRCUIT () and HAMILTONIAN PATH () are the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with edges. For each ϵ > 0 let HAMILTONIAN CIRCUIT (m ≥ (1 - ϵ)(ⁿ₂)) and HAMILTONIAN PATH (m ≥ (1 - ϵ)(ⁿ₂)) be the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted...
Procedures for Kernel Approximation and Solution of Fredholm Integral Equations of the Second Kind.
Procédures optimales pour le classement des meilleurs articles parmi au moyen de comparaisons binaires
Product form parametric representation of the solutions to a quadratic boolean equation
Production en temps réel et complexité de structure de suites infinies
Puiseux series solutions of ordinary polynomial differential equations: complexity study.