Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DETERMINISTIC ALGORITHM:
Reports tagged with Deterministic Algorithm:
TR05-008 | 11th December 2004
Neeraj Kayal

#### Recognizing permutation functions in polynomial time.

Let $\mathbb{F}_q$ be a finite field and $f(x) \in \mathbb{F}_q(x)$ be a rational function over $\mathbb{F}_q$.
The decision problem {\bf PermFunction} consists of deciding whether $f(x)$ induces a permutation on
the elements of $\mathbb{F}_q$. That is, we want to decide whether the corresponding map
$f : \mathbb{F}_q ... more >>> TR14-117 | 18th August 2014 Shiva Manne, Manjish Pal #### Fast Approximate Matrix Multiplication by Solving Linear Systems Comments: 1 In this paper, we present novel deterministic algorithms for multiplying two$n \times n$matrices approximately. Given two matrices$A,B$we return a matrix$C'$which is an \emph{approximation} to$C = AB\$. We consider the notion of approximate matrix multiplication in which the objective is to make the Frobenius ... more >>>

ISSN 1433-8092 | Imprint