Abstract: Recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi) graphs of all degrees and all sizes. However, that paper did not provide a polynomial time ...

Pick one up at http://www.adafruit.com/products/420 & http://www.adafruit.com/products/607! Written by Limor Fried/Ladyada & Phil Burgess/PaintYourDragon for Adafruit ...

Abstract: We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the ...

Improvements are being made in stages as we migrate content from educationstandards.nsw.edu.au. Stage 6 syllabus information and exam resources are the latest content to move, and other curriculum ...