Forbidden pairs combinatorics
Litow, B., and Deo, Narsingh (2000) Forbidden pairs combinatorics. Australasian Journal of Combinatorics, 22 . pp. 91-99.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 2781Kb |
View at Publisher Website: http://ajc.maths.uq.edu.au/pdf/22/ocr-aj...
Abstract
We define a formalism, forbidden pairs problems, in which many combinatorial constructions can be expressed. The formalism highlights the basic nature of a large number of combinatorial constraints. We also define an algebraic-arithmetic problem to which all forbidden pairs problems can be PTIME reduced.
| ID Code: | 12753 |
|---|---|
| Item Type: | Article (Refereed Research - C1) |
| Related URLs: | |
| FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100% |
| SEO Codes: | 89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100% |
| Deposited On: | 17 Jul 2012 12:06 |
| Last Modified: | 17 Jul 2012 12:06 |
| Downloads: | Total: 2 Last 12 Months: 1 |
| Statistics: | More Statistics |
Repository Staff Only: item control page