2661 search results - page 107 / 533 » Quantum Complexity Classes |
113
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
JC
2006
15 years 3 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
126
click to vote
DAM
2002
15 years 2 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
138
click to vote
LCPC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of l...
170
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...