서브메뉴
검색
Boolean Satisfiability: From Theoretical Hardness to Practical Success
Boolean Satisfiability: From Theoretical Hardness to Practical Success
Detailed Information
- 자료유형
- 기사
- ISSN
- 00010782
- 저자명
- Malik, S.
- 서명/저자
- Boolean Satisfiability: From Theoretical Hardness to Practical Success Malik, S. Zhang, L.
- 발행사항
- Broadway, NY : Association for Computing Machinery, 2009.
- 형태사항
- pp. 76-82
- 주기사항
- included reference
- 기타저자
- Zhang, L.
- 원문정보
- url
- 모체레코드
- 모체정보확인
- Control Number
- kjul:60250498
MARC
008200114s2009 ai aa eng■022 ▼a00010782
■1001 ▼aMalik, S.
■24510▼aBoolean Satisfiability:▼b From Theoretical Hardness to Practical Success▼dMalik, S.▼eZhang, L.
■260 ▼aBroadway, NY▼bAssociation for Computing Machinery▼c2009.
■300 ▼app. 76-82
■500 ▼aincluded reference
■7001 ▼aZhang, L.
■773 ▼tCommunications of the ACM.▼gVol. 52 No. 8 (2009. 8)▼d2009, 08
■856 ▼uhttp://www.acm.org/cacm/
■SIS ▼aS051935▼b60077699▼h8▼s2▼fP
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Info Détail de la recherche.
- Réservation
- n'existe pas
- My Folder
- Reference Materials for Thesis Writing
- Reference Materials for Research Ethics
- Job-Related Books
