Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | For a path system P=(x,R,S,T), where S X, T X, and R X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x T, or there exists admissible y, z X such that (x,y,z) R. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: PATH SYSTEM PROBLEM |
| Specialty definitions using "PATH SYSTEM PROBLEM": admissible vertex. (references) |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-b-e-e-h-l-m-m-o-p-p-r-s-s-t-t-y" | |
-3 letters: spermatophytes. | |
-4 letters: spermatophyte. | |
-5 letters: thermostable. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 41 54 48 53 59 53 54 45 4D 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01000001 01010100 01001000 00100000 01010011 01011001 01010011 01010100 01000101 01001101 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)P A T H   S Y S T E M   P R O B L E M |
ISO 10646 (1991-1993) (references)0050 0041 0054 0048 0053 0059 0053 0054 0045 004D 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)503554422535953543947250524936463947 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
