2233 search results - page 25 / 447 » On the Complexity of Theory Curbing |
117
Voted
DLT
2004
15 years 3 months ago
2004
Recently there have been some new initiatives in the field of parameterized complexity. In this paper, we will report on some of these, concentrating on some open questions, and al...
129
Voted
FOCS
2010
IEEE
14 years 12 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
118
click to vote
LICS
2002
IEEE
15 years 6 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
120
click to vote
MST
2010
14 years 8 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
111
Voted
AII
1989
15 years 6 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...