P/poly

Known as: PSIZE, Adleman's theorem, P%5CPoly 
In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomial… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
0102019722018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is… (More)
Is this relevant?
2012
2012
In this paper, we propose a novel protection scheme based on pre-configured polyhedron (p-poly) structure against multi-link… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Any proof of P!=NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen… (More)
Is this relevant?
2007
2007
We prove the following results: (i) PV proves NP ⊆ P/poly iff PV proves coNP ⊆ NP/O(1). (ii) If PV proves NP ⊆ P/poly then PV… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to proving circuit lower bounds for NEXP. More… (More)
Is this relevant?
1998
1998
We show that the class of sets having polynomial size circuits, P=poly, has EXPNP-measure zero under each of the following two… (More)
Is this relevant?
1995
1995
This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits P… (More)
Is this relevant?
1993
1993
The low hierarchy within NP and the extended low hierarchy h a ve turned out to be very useful in classifying many i n teresting… (More)
Is this relevant?
1985
1985
Let ~:= {f~,f2 . . . . } be a family of symmetric Boolean functions, where fn has n Boolean variables, for each n I> 1. L e t… (More)
Is this relevant?
1985
1985
Circular dichroism (CD) spectra in the vacuum UV region for different conformations of poly d(G-C) X poly d(G-C) and poly r(G-C… (More)
  • figure 1
  • figure 2
Is this relevant?