2661 search results - page 54 / 533 » Quantum Complexity Classes |
140
Voted
STACS
1994
Springer
15 years 4 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
51
Voted
ACL
1998
15 years 2 months ago
1998
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
ALT
2003
Springer
15 years 9 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
119
click to vote
CIE
2010
Springer
15 years 5 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
82
Voted
IJIT
2004
15 years 2 months ago
2004
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...