4 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.CC2010★ 4 cited
Min-Rank Conjecture for Log-Depth Circuits
S. Jukna, G. Schnitger
A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(…
cs.CC2010★ 3 cited
Circuits with arbitrary gates for random operators
S. Jukna, G. Schnitger
We consider boolean circuits computing n-operators f:{0,1}^n --> {0,1}^n. As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operato…
cs.FL2009
Ambiguity and Communication
Juraj Hromkovic, Georg Schnitger
The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we const…