Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Membership proofs for NP require a verifiable witness, bu... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→FACTORIZATION is in NP ∩ coNP simultaneously

    Membership proofs for NP require a verifiable witness, but FACTORIZATION's complement requires certifying the *absence* of non-trivial factors, which standard NP witnesses cannot directly encode.

    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Key Terms

    Complement (of a problem)(computational theory)
    The opposite version of a problem: if the original problem asks 'does this have property X?', the complement asks 'does this NOT have property X?'
    FACTORIZATION(Used as an example of a problem in NP ∩ coNP not currently known to be in P.)
    The computational problem: given ⟨n,m⟩, does n have a factor d with 1 < d ≤ m?
    Membership proof(computational logic)
    A way of demonstrating that something belongs to a particular group or category by showing evidence that it meets the required criteria.
    NP (nondeterministic polynomial time)(Major complexity class based on nondeterministic model)
    The union over all natural numbers k of NTIME(n^k); the class of languages decidable by a nondeterministic Turing machine in polynomial time.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Non-trivial factors(number theory)
    Divisors of a number that aren't the trivial ones (1 and the number itself)—the 'real' factors that reveal what the number is made of.
    Verifiable witness(computational proof theory)
    A piece of evidence or information that someone can check to confirm a claim is true, without needing to do all the hard work themselves.

    Connections

    1 topic

    Truth & Knowledge1 linked

    Related

    FACTORIZATION is in NP ∩ coNP simultaneously

    Details

    Type
    claim
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective