Sciweavers

15033 search results - page 379 / 3007
» Complexity Theory and Algorithms
Sort
View
RECOMB
1997
Springer
15 years 11 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SYNASC
2006
IEEE
64views Algorithms» more  SYNASC 2006»
16 years 1 months ago
Scheme-Based Systematic Exploration of Natural Numbers
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
Madalina Hodorog, Adrian Craciun
ICCS
2004
Springer
16 years 25 days ago
Graphical and Computational Representation of Groups
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
Alain Bretto, Luc Gillibert
JUCS
2008
91views more  JUCS 2008»
15 years 7 months ago
The Riemann Integral in Weak Systems of Analysis
: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce s...
Fernando Ferreira, Gilda Ferreira