Complete divisibility problems for slowly utilized oracles
From MaRDI portal
Publication:1083192
Recommendations
- On the oracle complexity of factoring integers
- On the complexity of linear arithmetic with divisibility
- Deterministic factoring with oracles
- On a certain nontraditional version of computations with oracles
- Generalized computations with binary oracles
- Deterministic integer factorization with oracles for Euler's totient function
- On oracle factoring of integers
- Polynomial-time random oracles and separating complexity classes
- Generalized computations with oracles
- scientific article; zbMATH DE number 4079399
Cites work
- scientific article; zbMATH DE number 3642710 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Fast verification, testing, and generation of large primes
- New NP-hard and NP-complete polynomial and integer divisibility problems
- Probabilistic Algorithms in Finite Fields
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Some Polynomial and Integer Divisibility Problems are $NP$-Hard
- Sparse complex polynomials and polynomial reducibility
- The network complexity and the Turing machine complexity of finite functions
Cited in
(2)
This page was built for publication: Complete divisibility problems for slowly utilized oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083192)
