Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > VALIANT'S MODEL:
Reports tagged with Valiant's model:
TR04-003 | 22nd December 2003
Pascal Koiran

#### Valiant's model and the cost of computing integers

Let $\tau(k)$ be the minimum number of arithmetic operations
required to build the integer $k \in \N$ from the constant 1.
A sequence $x_k$ is said to be easy to compute'' if
there exists a polynomial $p$ such that $\tau(x_k) \leq p(\log k)$
for all $k \geq ... more >>> TR18-182 | 31st October 2018 Henry Corrigan-Gibbs, Dmitry Kogan #### The Function-Inversion Problem: Barriers and Opportunities Revisions: 1 We study preprocessing algorithms for the function-inversion problem. In this problem, an algorithm gets oracle access to a function$f\colon[N] \to [N]$and takes as input$S$bits of auxiliary information about$f$, along with a point$y \in [N]$. After running for time$T\$, the algorithm must output an ... more >>>

ISSN 1433-8092 | Imprint