1209 search results - page 54 / 242 » Universal Algebra and Computer Science |
FOCS
1992
IEEE
14 years 24 days ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
CSCL
2007
13 years 8 months ago
2007
Traditionally, universities focus primarily on instructionist teaching. Such an understanding has been criticized from theoretical and practical points of view. We believe that so...
SMA
2003
ACM
14 years 2 months ago
2003
ACM
Parametric feature-based CAD data exchange is one of the most important open problems in solid modeling. The problem is significant and challenging both scientifically and comme...
ALGORITHMICA
2005
13 years 8 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
CSB
2005
IEEE
14 years 2 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...