
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf, "kApproximating Circuits," IEEE Transactions on Computers, vol. 55, no. 7, pp. 913917, July, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.105, author = {Marco Cadoli and Francesco M. Donini and Paolo Liberatore and Marco Schaerf}, title = {kApproximating Circuits}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {7}, issn = {00189340}, year = {2006}, pages = {913917}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.105}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  kApproximating Circuits IS  7 SN  00189340 SP913 EP917 EPD  913917 A1  Marco Cadoli, A1  Francesco M. Donini, A1  Paolo Liberatore, A1  Marco Schaerf, PY  2006 KW  Reliability and testing KW  complexity measures and classes KW  models of computation. VL  55 JA  IEEE Transactions on Computers ER   
[1] S. Arora, L. Babai, J. Stern, and Z. Sweedyk, “The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations,” J. Computer and System Sciences, vol. 54, pp. 317331, 1997.
[2] E. Berlekamp, R. McEliece, and H. van Tilborg, “On the Inherent Intractability of Certain Coding Problems,” IEEE Trans. Information Theory, vol. 24, pp. 384386, 1978.
[3] R. Boppana and M. Sipser, “The Complexity of Finite Functions,” Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, chapter 14, pp. 757804, Amsterdam: Elsevier Science Publishers, 1990.
[4] M. Cadoli, F.M. Donini, P. Liberatore, and M. Schaerf, “Space Efficiency of Propositional Knowledge Representation Formalisms,” J. Artificial Intelligence Research, vol. 13, pp. 131, 2000.
[5] M. Cadoli, F.M. Donini, P. Liberatore, and M. Schaerf, “Preprocessing of Intractable Problems,” Information and Computation, vol. 176, no. 2, pp. 89120, 2002.
[6] R. Downey, M. Fellows, A. Vardy, and G. Whittle, “The Parameterized Complexity of Some Fundamental Problems in Coding Theory,” SIAM J. Computing, vol. 29, no. 2, pp. 545570, 1999.
[7] I. Dumer, D. Micciancio, and M. Sudan, “Hardness of Approximating the Minimum Distance of a Linear Code,” IEEE Trans. Information Theory, vol. 49, pp. 2237, 2003.
[8] I. Eidhammer, I. Jonassen, S. Grindhaug, D. Gilbert, and M. Ratnayake, “A Constraint Based Structure Description Language for Biosequences,” Constraints, vol. 6, pp. 173200, 2001.
[9] H. Chen, “Parameterized Compilability,” Proc. 19th Int'l Joint Conf. Artificial Intelligence (IJCAI 2005), 2005.
[10] D.S. Johnson, “A Catalog of Complexity Classes,” Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, chapter 2, pp. 67161, Amsterdam: Elsevier Science Publishers, 1990.
[11] V. Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals,” Soviet Physics Doklady, vol. 10, 1966.
[12] B. Manthey and R. Reischuk, “The Intractability of Computing the Hamming Distance,” Theoretical Computer Science, vol. 337, pp. 331346, 2005.
[13] G. Mehldau and G. Myers, “A System for Pattern Matching Applications on Biosequences,” Computer Applications in the Biosciences, vol. 9, pp. 299314, 1993.
[14] P. Penna, “Succinct Representations of Model Based Belief Revision,” Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS 2000), pp. 205216, 2000.
[15] G. Pighizzini, “How Hard Is Computing the Edit Distance?” Information and Computation, vol. 165, pp. 113, 2001.
[16] N. Pippenger, “Information Theory and the Complexity of Boolean Functions,” Math. Systems Theory, vol. 10, pp. 129167, 1977.
[17] A. Prasad Sistla, T. Hu, and V. Chowdhry, “Similarity Based Retrieval from Sequence Databases Using Automata As Queries,” Proc. 2002 ACM CIKM Int'l Conf. Information and Knowledge Management, pp. 237244, 2002.
[18] J. Stern, “A New Paradigm for Public Key Identification,” IEEE Trans. Information Theory, vol. 42, pp. 17571768, 1996.