136 search results - page 9 / 28 » About Duval's Conjecture |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
ECTEL
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we introduce a new, formal model of learning object metadata. The model enables more formal, rigorous reasoning over metadata. An important feature of the model is t...
CATS
2007
13 years 9 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
JCT
2007
13 years 7 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
DM
2011
12 years 11 months ago
2011
A k-plex of a latin square is a collection of cells representing each row, column, and symbol precisely k times. The classic case of k = 1 is more commonly known as a transversal....