Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
어떤 최대최소문제들에 대한 컴퓨터대수체계(CAS)의 이용
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 김선홍 | - |
| dc.date.available | 2021-02-22T13:46:04Z | - |
| dc.date.issued | 2010-12 | - |
| dc.identifier.issn | 2005-1042 | - |
| dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/13071 | - |
| dc.description.abstract | In this paper, we study how to use CAS to solve certain minmax problems. More specifically, we reduce some to the problems about the packing of certain convex sets in the plane, and use Recognize algorithm to obtain good hypotheses for results. This method can be widely used to solve same types of mathematical problems. | - |
| dc.format.extent | 5 | - |
| dc.language | 한국어 | - |
| dc.language.iso | KOR | - |
| dc.publisher | 조선대학교 기초과학연구원 | - |
| dc.title | 어떤 최대최소문제들에 대한 컴퓨터대수체계(CAS)의 이용 | - |
| dc.title.alternative | How to Use CAS to Solve Certain Minmax Problems | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.doi | 10.13160/ricns.2010.3.4.241 | - |
| dc.identifier.bibliographicCitation | 조선자연과학논문집, v.3, no.4, pp 241 - 245 | - |
| dc.citation.title | 조선자연과학논문집 | - |
| dc.citation.volume | 3 | - |
| dc.citation.number | 4 | - |
| dc.citation.startPage | 241 | - |
| dc.citation.endPage | 245 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | kciCandi | - |
| dc.identifier.url | http://koreascience.or.kr/article/JAKO201018452369096.page | - |
- Files in This Item
- Go to Link
- Appears in
Collections - 이과대학 > 수학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.