On sets with efficient implicit membership tests

The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded that many complex sets have polynomial-time implicit membership tests. Thus, the complexity of implicit membership testing is closely related...

Full description

Saved in:
Bibliographic Details
Published inProceedings Fifth Annual Structure in Complexity Theory Conference pp. 11 - 19
Main Authors Hemachandra, L.A., Hoene, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Computer science
Polynomials
Testing
Turing machines
Online AccessGet full text

Cover

Abstract The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded that many complex sets have polynomial-time implicit membership tests. Thus, the complexity of implicit membership testing is closely related to the complexity of optimization.< >
AbstractList The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded that many complex sets have polynomial-time implicit membership tests. Thus, the complexity of implicit membership testing is closely related to the complexity of optimization.< >
Author Hoene, A.
Hemachandra, L.A.
Author_xml – sequence: 1
  givenname: L.A.
  surname: Hemachandra
  fullname: Hemachandra, L.A.
  organization: Dept. of Comput. Sci., Rochester Univ., NY, USA
– sequence: 2
  givenname: A.
  surname: Hoene
  fullname: Hoene, A.
BookMark eNp9jUELgkAQRgcqKMtz0Gn_QDabpu5Zim4d8i4WI064mzgL0b-vqHOn7z3e4Qtg7O6OAJYaI63RbM5FGWljPhabHY4gwFznaYrZNplCKHJDRG1Sg0k2Azw5JeRFPdi3ipqGr0zOK7Z990avLNkLDdJyrzyJlwVMmroTCn87h9VhXxbHNRNR1Q9s6-FZfb_jv_EFiWsz9A
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCT.1990.113950
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Mathematics
EndPage 19
ExternalDocumentID 113950
GroupedDBID 6IE
6IK
6IL
AAJGR
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-ieee_primary_1139503
IEDL.DBID RIE
ISBN 0818660724
9780818660726
IngestDate Wed Jun 26 19:31:56 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-ieee_primary_1139503
ParticipantIDs ieee_primary_113950
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Proceedings Fifth Annual Structure in Complexity Theory Conference
PublicationTitleAbbrev SCT
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0001969047
Score 2.4261572
Snippet The complexity of implicit membership testing is characterized in terms of the well-known complexity class OptP, optimization polynomial time. It is concluded...
SourceID ieee
SourceType Publisher
StartPage 11
SubjectTerms Computer science
Polynomials
Testing
Turing machines
Title On sets with efficient implicit membership tests
URI https://ieeexplore.ieee.org/document/113950
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ1NS8NAEIYH7Ukv1VjR-sEevCbdJNvd7LlYilAVrNBbSdIJFDEVs7n017uzSVuRHrwlOSxDwjI7b-Z9BuChkEk2lAX6SY6pL1Sm_QR17qcYK1RSqaWTsqfPcvIunubDecvZdl4YRHTNZxjQpfuXv1znNUllg9AeV6g-P0541Fi19nKKtmWeUI7wSAw3riLR8nW297Il-4RcD95GM_LpuZEmmjz3v0aruMwy7jaW7coBCamh5COoTRbkmz-4xn8GfQa9vYWPve6S0zkcYelBdzvDgbVb2oPT6Y7bWl0AfylZhaZiJM8ydHgJuzpbub7zlWGfSANEqMOL2TOqqXrQHz_ORhOfIlp8NeiKRRNMfAmdcl3iFbBlHKWKmD5pzkUsbP3DRVjoUEQESi3kNXgHFugffHoDJ_ROG4HiFjrmu8Y7m7JNdu8-1g9UjZXh
link.rule.ids 310,311,786,790,795,796,802,4069,4070,27958,55109
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3LT4NAEMYnph7USxVrtL724BXKY8vCubFBLdVETHojPIakMVIjcPGvd2ehrTE9eAMSNhMImZ2P-X4DcFe4Xjp2C9S9DBOdi9TXPfQzPUFHoHCFyJWUHc7d4I0_LsaLjrOtvDCIqJrP0KBD9S8_X2UNSWUjS25XqD7fl2ne9Fuz1lZQ8WWhx4ViPBLFzRQ27wg763O3Y_vIm0evk4icemqoiU-u-1_DVVRumfZb03alkITUUvJuNHVqZN9_gI3_DPsYBlsTH3vZpKcT2MNSg_56igPrPmoNjsINubU6BfO5ZBXWFSOBlqECTMjV2VJ1ni9r9oE0QoR6vJjcpdbVAIbT-2gS6BRR_NnCK-I2GOcMeuWqxHNguWMngqg-SWZyh8sKyORW4VvcJlRq4V6AtmOB4c6rt3AQROEsnj3Mny7hkJ5vK1dcQa_-avBaJvA6vVEv7gdzCJk3
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+Fifth+Annual+Structure+in+Complexity+Theory+Conference&rft.atitle=On+sets+with+efficient+implicit+membership+tests&rft.au=Hemachandra%2C+L.A.&rft.au=Hoene%2C+A.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818660726&rft.spage=11&rft.epage=19&rft_id=info:doi/10.1109%2FSCT.1990.113950&rft.externalDocID=113950
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818660726/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818660726/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818660726/sc.gif&client=summon&freeimage=true