MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Polynomial Time Reducibility" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 315 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • A Comparison of Polynomial Time Redicibilities  
  • by R. Ladner, N. Lynch, A. L. Selman — 1975 — Theoretical Computer Science
  • … (1975) 103-123. North-Holland Publishing Company A COMPARISON OF POLYNOMIAL TIME REDUCIBILITIES R. E…
  • Add To MetaCart
  • On Using Oracles That Compute Values  
  • by Stephen Fenner, Steve Homer, Mitsunori Ogiwara, Alan L. Selman — 1993 — In Proc. 10th Annual Symp. on Theoret. Aspects of Computer Science, Lecture Notes in Computer Science
  • … reducibilities, it is shown that 1. A multivalued partial function is polynomial-time computable with k adaptive…
  • Cited by 16 (5 self) – Add To MetaCart
  • Generating Partial and Multiple Transversals of a Hypergraph  
  • by Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino — 2000 — Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), Lecture Notes in Computer Science
  • … of an arbitrary hypergraph are polynomial-time reducible to the well-known dualization problem of hypergraphs…
  • Cited by 4 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB