Sciweavers

8094 search results - page 62 / 1619
» Improvements in Formula Generalization
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
13 years 9 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
NA
2008
99views more  NA 2008»
13 years 9 months ago
Nontensorial Clenshaw-Curtis cubature
We extend Clenshaw-Curtis quadrature to the square in a nontensorial way, by using Sloan's hyperinterpolation theory and two families of points recently studied in the framew...
Alvise Sommariva, Marco Vianello, Renato Zanovello
MOC
2002
132views more  MOC 2002»
13 years 8 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...