Pages that link to "Item:Q4077450"

The following pages link to Every Prime Has a Succinct Certificate (Q4077450):

Displaying 50 items.

• The complexity of computing the permanent (Q600247) (← links)
• Prime chains and Pratt trees (Q607663) (← links)
• Two remarks on iterates of Euler's totient function (Q652233) (← links)
• On total functions, existence theorems and computational complexity (Q808245) (← links)
• Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? (Q912625) (← links)
• Complexity questions in number theory (Q1059094) (← links)
• Optimal information retrieval when queries are not random (Q1061507) (← links)
• New NP-hard and NP-complete polynomial and integer divisibility problems (Q1062447) (← links)
• Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity (Q1076669) (← links)
• On hardness of one-way functions (Q1097693) (← links)
• Minimum disclosure proofs of knowledge (Q1110348) (← links)
• Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
• The generation of random numbers that are probably prime (Q1118632) (← links)
• Fast verification, testing, and generation of large primes (Q1132906) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Recent developments in primality testing (Q1160213) (← links)
• Some observations on the probabilistic algorithms and NP-hard problems (Q1163371) (← links)
• The influence of computers in the development of number theory (Q1164656) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• Self-witnessing polynomial-time complexity and prime factorization (Q1200292) (← links)
• Riemann's hypothesis and tests for primality (Q1235011) (← links)
• Complexity of some problems in Petri nets (Q1238999) (← links)
• NP-complete decision problems for binary quadratics (Q1243130) (← links)
• Efficient search for rationals (Q1259410) (← links)
• On hiding information from an oracle (Q1263281) (← links)
• The relative complexity of NP search problems (Q1273858) (← links)
• On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
• The complexity of mean payoff games on graphs (Q1351468) (← links)
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
• Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
• Prime-number algorithm for public-key systems (Q1816016) (← links)
• Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
• Poisson-Dirichlet branching random walks (Q1948689) (← links)
• Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519) (← links)
• Knottedness is in NP, modulo GRH (Q2445896) (← links)
• Pairing inversion for finding discrete logarithms (Q2515203) (← links)
• A bi-directional extensible interface between Lean and Mathematica (Q2673306) (← links)
• $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
• Construction of logarithm tables for Galois Fields (Q3069685) (← links)
• A Proposal for Broad Spectrum Proof Certificates (Q3100201) (← links)
• Elliptic Curves and Primality Proving (Q3137447) (← links)
• Aristotle, Boole, and Categories (Q3299850) (← links)
• On values taken by the largest prime factor of shifted primes (Q3435408) (← links)
• P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP (Q4190619) (← links)
• Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
• Classroom Notes (Q4359679) (← links)
• Classroom Notes (Q4360744) (← links)
• Classroom Notes (Q4360745) (← links)