On Pseudodeterministic Approximation Algorithms. (Q5005164): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
On Pseudodeterministic Approximation Algorithms.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of NP-witnesses using an NP-oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles and queries that are sufficient for exact learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of key agreement on small ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the possibilities and limitations of pseudodeterministic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Perfect Matching in Pseudo-Deterministic NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reproducibility and Pseudo-Determinism in Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Collapse Consequences of NP Having Small Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudodeterministic constructions in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Lower Bounds for Merlin–Arthur Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the circuit complexity of PP / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2018.html#DixonPV18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2888826740 / rank
 
Normal rank
Property / title
 
On Pseudodeterministic Approximation Algorithms. (English)
Property / title: On Pseudodeterministic Approximation Algorithms. (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:51, 30 July 2024

scientific article; zbMATH DE number 7378378
Language Label Description Also known as
English
On Pseudodeterministic Approximation Algorithms.
scientific article; zbMATH DE number 7378378

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    approximation algorithms
    0 references
    circuit lower bounds
    0 references
    pseudodeterminism
    0 references
    On Pseudodeterministic Approximation Algorithms. (English)
    0 references

    Identifiers