In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomialâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Richard Whyman
- PC
- 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

- Shanguo Huang, Jie Zhang, Xin Li, Yongli Zhao, Wanyi Gu
- 7th International Conference on Communicationsâ€¦
- 2012

In this paper, we propose a novel protection scheme based on pre-configured polyhedron (p-poly) structure against multi-linkâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Scott Aaronson, Avi Wigderson
- STOC
- 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

- Stephen A. Cook, Jan KrajÃcek
- J. Symb. Log.
- 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

- Valentine Kabanets, Russell Impagliazzo
- computational complexity
- 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

- Johannes KÃ¶bler, Wolfgang Lindner
- IEEE Conference on Computational Complexity
- 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

- Jack H. Lutz
- Structure in Complexity Theory Conference
- 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

- Johannes KÃ¶bler
- STACS
- 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

- Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer
- Theor. Comput. Sci.
- 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

- J. H. Riazance, W. A. Baase, W. C. Johnson, K. Hall, P. Cruz, Ignacio Tinoco
- Nucleic Acids Research
- 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)

Is this relevant?