13306 search results - page 370 / 2662 » Theoretical Computer Science |
165
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
171
click to vote
RTA
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
172
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
171
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
147
Voted
ITICSE
2004
ACM
16 years 7 days ago
2004
ACM
: Recent research has shown that students should be familiar with computer history. This paper examines three projects whose goals are to bring history of computers and technology ...