2661 search results - page 202 / 533 » Quantum Complexity Classes |
130
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
132
Voted
ICDT
1997
ACM
15 years 7 months ago
1997
ACM
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
143
Voted
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
95
Voted
NIPS
2003
15 years 5 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
124
click to vote
SIAMMAX
2010
14 years 10 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...