skip to content
Nondeterministic bounded query reducibilities Preview this item
ClosePreview this item
Checking...

Nondeterministic bounded query reducibilities

Author: Richard Beigel; William I Gasarch; Jim Owings
Publisher: College Park, Md. : University of Maryland, [1987?]
Series: Computer science technical report series (College Park, Md.), TR-1857.
Edition/Format:   Book : State or province government publication : English
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Government publication, State or province government publication
Document Type: Book
All Authors / Contributors: Richard Beigel; William I Gasarch; Jim Owings
OCLC Number: 21237142
Description: 15 pages ; 28 cm.
Series Title: Computer science technical report series (College Park, Md.), TR-1857.
Responsibility: by Richard Beigel, William Gasarch, Jim Owings.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/21237142>
library:oclcnum"21237142"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/21237142>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1987"
schema:datePublished""
schema:exampleOfWork<http://worldcat.org/entity/work/id/23329997>
schema:inLanguage"en"
schema:name"Nondeterministic bounded query reducibilities"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.