Pages that link to "Item:Q4978012"
From MaRDI portal
The following pages link to Pseudodeterministic constructions in subexponential time (Q4978012):
Displaying 9 items.
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- On Pseudodeterministic Approximation Algorithms. (Q5005164) (← links)
- Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Pseudodeterministic algorithms and the structure of probabilistic time (Q6087003) (← links)