Sciweavers

1920 search results - page 25 / 384
» The Complexity of the A B C Problem
Sort
View
DM
1999
133views more  DM 1999»
15 years 5 months ago
The answer to Woodall's musquash problem
We prove that there are no n-agonal musquashes for n even with n = 6. This resolves a problem raised in Woodall's 1971 paper `Thrackles and Deadlock'. c 1999 Elsevier Sc...
Grant Cairns, Deborah M. King
DISOPT
2007
93views more  DISOPT 2007»
15 years 5 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
APPML
2007
95views more  APPML 2007»
15 years 6 months ago
On the solvability of two-point, second-order boundary value problems
We gain solvability to a system of nonlinear, second-order ordinary differential equations subject to a range of boundary conditions. The ideas involve differential inequalities...
Matthew Rudd, Christopher C. Tisdell
JSC
2002
68views more  JSC 2002»
15 years 5 months ago
Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups
, Allen C.) see Innovations in teaching abstract algebra, 2003b:00019 Littlewood, D. E. The skeleton key of mathematics. (English summary) 2003j:01046 Magnin, Louis Quelques questi...
Bettina Eick
ECOOP
2006
Springer
15 years 9 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha