[ Algorithms ] 2-SAT, 2 - Satisfiability
2-SAT 혹은 2SAT 이라고 한다. Determining whether a collection of two-valued(boolean or binary ) variables with constraints on pairs of variables can be assigned values satisfying all the constraints. Boolean satisfiability problem,constraint satisfaction problems 의 특수 케이스, 2-CNF 혹은 Krom formulas 라고 표현되기도 함. Problem conjunction of disjunctions , where each disjunction ( or operation ) has two arguments ..
Problem Solving/ACM-ICPC
2011. 9. 5. 10:19
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
TAG
- js function
- kernel source tree
- html list
- var type
- javascript function
- kernel download
- sqlite page modify
- Java script loop
- python flow control
- check property
- javascript loop
- 태그를 입력해 주세요.
- python if
- javascripts basic
- javascript object
- javascript random
- object type
- javascript array
- python control flow
- python alpha
- print object
- for statement
- has own property
- javascript floor
- kernel basic
- javascript dragon game
- javascript for
- kernel patch
- javascript math
- variable type
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
글 보관함