Stephen A. Fenner Lance Fortnow Ashish V. Naik John D. Rogers  Home/Search
Context Related
| depaul.edu/~jrogers/...InvertingOnto.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: depaul.edu/~jrogers/Publicatio... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including ffl In polynomial time, one can ønd accepting paths of nondeterministic polynomial-time Turing machines that accept \Sigma . ffl Every total multivalued nondeterministic function has a polynomial-time computable re- ønement. ffl In polynomial time, one can compute satisfying... (Update)
Context of citations to this paper: More
...is a proof of formula ff) is p optimal, was considered in different nomenclature by S. Fenner, L. Fortnow, A. Naik and J. Rogers in [3] (see also [7] A proof system for a language L is a polynomial time computable function whose range is L. This notion was defined by S....
Cited by: More
On the Complexity of Search Queries - Leone, Palopoli, Sacca (1999) (Correct)
Properties of NP-Complete Sets - Glaßer, Pavan, Selman, Sengupta (2004) (Correct)
One-Way Permutations and Self-Witnessing Languages - Homan, Thakur (2001) (Correct)
Similar documents (at the sentence level):
69.6%: Inverting Onto Functions - Fenner, Fortnow, Naik, Rogers (1996) (Correct)
33.9%: On Inverting Onto Functions - Fenner, Fortnow, Naik, Rogers (1996) (Correct)
Active bibliography (related documents): More All
0.0: Separability and One-way Functions - Lance Fortnow John (1994) (Correct)
0.0: P-Selective Sets, and Reducing Search to Decision.. - Hemaspaandra.. (1993) (Correct)
0.0: The Complexity of Decision versus Search - Bellare, Goldwasser (1994) (Correct)
Similar documents based on text: More All
0.2: Complexity Limitations on Quantum Computation - Fortnow, Rogers (1997) (Correct)
0.2: Deterministic and Randomized Bounded Truth-table Reductions of .. - van Melkebeek (Correct)
0.2: Separating Complexity Classes using Autoreducibility - Buhrman, Fortnow, van.. (1998) (Correct)
Related documents from co-citation: More All
8: Complexity measures for public-key cryptosystems (context) - Grollmann, Selman - 1988
7: Computational Complexity (context) - Papadimitriou - 1994
7: A taxonomy of complexity classes of functions - Selman - 1994
BibTeX entry: (Update)
Stephen Fenner, Lance Fortnow, Ashish Naik, John Rogers. Inverting Onto Functions. Proceedings of the 11th Annual Conference on Computational Complexity Theory, 1996. http://citeseer.ist.psu.edu/article/fenner96inverting.html More
@inproceedings{ fenner96inverting,
author = "Stephen A. Fenner and Lance Fortnow and Ashish V. Naik and John D. Rogers",
title = "Inverting Onto Functions",
booktitle = "{IEEE} Conference on Computational Complexity",
pages = "213-222",
year = "1996",
url = "citeseer.ist.psu.edu/article/fenner96inverting.html" }
Citations (may not include all citations):173 Trading group theory for randomness (context) - Babai - 1985
109 Relative to a random oracle (context) - Bennett, Gill
27 The relative complexity of NP search problems - Beame, Cook et al. - 1995
19 Some comments on functional self-reducibility and the NP hie.. (context) - Borodin, Demers - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.depaul.edu/~jrogers/Publications/):
Complexity Limitations on Quantum Computation - Fortnow, Rogers (1997) (Correct)
A note on the Isomorphism Conjecture and one-way functions - Rogers (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC