Jump to main content

yr 〜
yr

Search results 9

Hardness of approximation between P and NP : hardcover

Hardness of approximation between P and NP : hardcover
Paper図書
Aviad RubinsteinAssociation for Computing Machineryc2019
Other Libraries in Japan

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan. (Lecture notes in computer science ; 1001)

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan. (Lecture notes in computer science ; 1001)
Paper図書
Springerc1995.<MA41-A99>
National Diet Library

The golden ticket : P, NP, and the search for the impossible : pbk

The golden ticket : P, NP, and the search for the impossible : pbk
Paper図書
Lance FortnowPrinceton University Press[2017], c2013
Other Libraries in Japan

The golden ticket : P, NP, and the search for the impossible

The golden ticket : P, NP, and the search for the impossible
Paper図書
Lance FortnowPrinceton University Pressc2013
Other Libraries in Japan

Computational complexity in the design of voting rules

Computational complexity in the design of voting rules
Paper文書・図像類
Takamiya, Koji, Tanaka, AkiraThe Institute of Social and Economic Research, Osaka University2006-07Institute of Social and Economic Research Discussion Papers653p.1-9
Other Libraries in Japan
  • Subject Headingcomputational complexity NP-completeness simple game core stability Na...

3人部屋安定ルームメイト問題のNP完全性

3人部屋安定ルームメイト問題のNP完全性
Digital文書・図像類
岡本, 和也, 宮崎, 修一, 岩間, 一雄電子情報通信学会2007-10-09電子情報通信学会技術研究報告107 258p.1-6
Available onlineOther Libraries in Japan
  • Alternative TitleNP-Completeness of the Stable Roommates Probl...
  • Alternative TitleNP-Completeness of the Stable Roommates Probl...

Efficient checking of polynomials and proofs and the hardness of approximation problems

Efficient checking of polynomials and proofs and the hardness of approximation problems
Paper図書
Madhu SudanSpringer-Verlagc1995
Other Libraries in Japan

条件を緩和した安定結婚問題のNP完全性について

条件を緩和した安定結婚問題のNP完全性について
Digital文書・図像類
宮崎, 修一, 岩間, 一雄Institute of Electronics, Information and Communications Engineers (IEICE)1998-11-20電子情報通信学会技術研究報告98 432p.33-40
Available onlineOther Libraries in Japan
  • Subject Heading...gnment problem NP-completeness 安定結婚問題 半順序 学生配属問題 NP完全性
  • Alternative TitleOn the NP-Completeness of weakly stable marriage
  • Alternative TitleOn the NP-Completeness of weakly stable marriage

Complexity of Finding Alphabet Indexing

Complexity of Finding Alphabet Indexing
Digital文書・図像類
下薗, 真一, 宮野, 悟Research Institute of Fundamental Information Science, Kyushu University1992-08RIFIS Technical Report61
Available onlineOther Libraries in Japan

Reached to the end of result.

RSS