BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Graph explorer

Generic case completeness

In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.

6 nodes6 linksoverview mapGeneric case completeness
SearchCollections
6 nodes6 links
Generic case completeness6 visible / 6 total nodes / 7 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalRelated contextWGeneric case completenesspreprint / 2016AAlexei MiasnikovResearcherAAlexander UshakovResearcherTLogic in Computer Science2208 worksTmath.GR2651 worksTComputational Complexity1354 works
PaperSignal 105 links

Generic case completeness

preprint / 2016

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached so you can return to the same research slice later.

Sign in

Public snapshots

1 shared view(s)