ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > COUNTING:
Reports tagged with counting:
TR99-032 | 7th July 1999
Cristopher Moore

Quantum Circuits: Fanout, Parity, and Counting

We propose definitions of $\QAC^0$, the quantum analog of the classical class $\AC^0$ of constant-depth circuits with AND and OR gates of arbitrary fan-in, and $\QACC^0[q]$, the analog of the class $\ACC^0[q]$ where $\Mod_q$ gates are also allowed. We show that it is possible to make a `cat' state on ... more >>>

TR05-121 | 17th October 2005
Martin Dyer, Leslie Ann Goldberg, Michael S. Paterson

On counting homomorphisms to directed acyclic graphs

We give a dichotomy theorem for the problem of counting homomorphisms to directed acyclic graphs. $H$ is a fixed directed acyclic graph. The problem is, given an input digraph $G$, how many homomorphisms are there from $G$ to $H$. We give a graph-theoretic classification, showing that for some digraphs $H$, ... more >>>

TR08-087 | 31st July 2008
Tomas Feder, Carlos Subi

Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised)

It has been shown that for every perfect matching $M$ of the $d$-dimensional $n$-vertex hypercube, $d\geq 2, n=2^d$, there exists a second perfect matching $M'$ such that the union of $M$ and $M'$ forms a Hamiltonian circuit of the $d$-dimensional hypercube. We prove a generalization of a special case of ... more >>>



ISSN 1433-8092 | Imprint