1730 search results - page 179 / 346 » Algebra and Computation |
152
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...
160
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
263
Voted
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
397
click to vote
Tutorial
"These video lectures provide a thorough and unified treatment of adaptive filters and their performance. The lectures cover the fundamentals of linear estimation theory, adap...
166
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while...