Automata, Languages and Programming
From MaRDI portal
Publication:5466454
DOI10.1007/b99859zbMath1098.68629MaRDI QIDQ5466454
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
92C40: Biochemistry, molecular biology
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions, Learning a hidden graph using \(O(\log n)\)queries per edge, Linear Time Constructions of Some $$d$$-Restriction Problems