Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The counting complexity of group-definable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Effective Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursive equivalence type of a class of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverting onto functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every polynomial-time 1-degree collapses if and only if P = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes of equivalence problems revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Autoreducibility and Mitoticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoreducibility, mitoticity, and immunity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting NP-Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions between disjoint NP-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of unions of disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalability and the isomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets polynomially enumerable by iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-Selective sets and reducing search to decision vs. self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semi-feasible algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Solutions Uniquely Collapses the Polynomial Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiom of choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on witness functions for nonpolynomial and noncomplete sets in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some natural complete operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, Approximation and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism conjecture fails relative to a random oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category and Measure in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability and recursive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Structure Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-theoretic algebra. II: Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5337203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Enumeration Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on NP real numbers and P-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions on NP and p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Self-Reducible Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite axioms of choice / rank
 
Normal rank

Revision as of 10:29, 2 August 2024

scientific article; zbMATH DE number 7719400
Language Label Description Also known as
English
Polynomial-time axioms of choice and polynomial-time cardinality
scientific article; zbMATH DE number 7719400

    Statements

    Polynomial-time axioms of choice and polynomial-time cardinality (English)
    0 references
    0 references
    26 July 2023
    0 references
    structural complexity
    0 references
    function complexity
    0 references
    axiom of choice
    0 references
    cardinality
    0 references
    function invertibility
    0 references
    p-isomorphism
    0 references
    structural properties of languages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references