Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets

Journal article

Open access

Peer reviewed

Mitsunori Ogiwara and Osamu Watanabe

SIAM journal on computing, Vol.20(3), pp.471-483

1991-06

Files and links (1)

url

https://doi.org/10.1137/0220030View

Published (Version of record) Open

15 Record Views

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.182 Data Structures, Algorithms & Complexity; 4.182.1226 Computability
Web Of Science research areas: Computer Science, Theory & Methods; Mathematics, Applied
ESI research areas: Computer Science

This output has contributed to the advancement of the following goals:

Source: InCites

Title: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
Creators: Mitsunori Ogiwara
Osamu Watanabe
Publication Details: SIAM journal on computing, Vol.20(3), pp.471-483
Language: English
Resource Type: Journal article
Record Identifier: 991031615263602976