Sciweavers

77 search results - page 5 / 16
» The Zeta Function of a Hypergraph
Sort
View
FOSSACS
2004
Springer
14 years 23 days ago
Hypergraphs and Degrees of Parallelism: A Completeness Result
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
Antonio Bucciarelli, Benjamin Leperchey
FCT
2003
Springer
14 years 18 days ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
PODS
2007
ACM
159views Database» more  PODS 2007»
14 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...
JOC
2006
103views more  JOC 2006»
13 years 7 months ago
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
Jan Denef, Frederik Vercauteren
FOIKS
2008
Springer
13 years 9 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler