Monotonous and randomized reductions to sparse sets
- Author
- ARVIND, V1 ; KÖBLER, J2 ; MUNDHENK, M3
[1] Department of Computer Science, Institute of Mathematical Sciences, C.I.T. Campus, Madras 600113, India
[2] Universität Ulm, Theoretische Informatik, 89069 Ulm, Germany
[3] Universität Trier, FB IV-Informatik, 54286 Trier, Germany - Conference title
- Probalistic complexity classes and nonuniform computational models. Workshop
- Conference name
- Probalistic complexity classes and nonuniform computational models. Workshop (Barcelona 1993-09-13)
- Author (monograph)
- Universitat Politècnica de Catalunya ; Department Llenguatges i Sistemes Informàtics, Barcelona, Spain (Funder/Sponsor)
DAAD Deutscher Akademischer Austauschdienst, Bonn Bad Godesberg, Germany (Funder/Sponsor)
Ministry of Education and Science ; Acciones Integradas, Spain (Funder/Sponsor) - Source
Informatique théorique et applications (Imprimé). = Theoretical informatics and applications. 1996, Vol 30, Num 2, pp 155-179 ; ref : 42 ref
- CODEN
- RITAE4
- ISSN
- 0988-3754
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- EDP Sciences, Paris
- Publication country
- France
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Approche probabiliste Classe complexité Complexité calcul Complexité temps Dimension Hausdorff Ensemble épars Machine Turing Réductibilité
- Keyword (en)
- Probabilistic approach Complexity class Computational complexity Time complexity Hausdorff dimension Sparse set Turing machines Reducibility
- Keyword (es)
- Enfoque probabilista Clase complejidad Complejidad tiempo Dimensión Hausdorff Reductibilidad
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A03 Automata. Abstract machines. Turing machines
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 3248776
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1051/ita/1996300201551 
https://dx.doi.org/10.1051/ita/1996300201551
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Informatique th\u00e9orique et applications (Imprim\u00e9)\";s:9:\"\u0000*\u0000stitle\";s:30:\"Inform. th\u00e9or. appl. Imprim\u00e9\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"179\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0988-3754\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ARVIND\";s:10:\"\u0000*\u0000aufirst\";s:1:\"V\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"K\u00d6BLER, J\";i:1;s:11:\"MUNDHENK, M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"RITAE4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:76:\"Probalistic complexity classes and nonuniform computational models. Workshop\";s:8:\"\u0000*\u0000title\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:12:\"EDP Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Informatique th\u00e9orique et applications (Imprim\u00e9)\";s:9:\"\u0000*\u0000stitle\";s:30:\"Inform. th\u00e9or. appl. Imprim\u00e9\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"179\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0988-3754\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ARVIND\";s:10:\"\u0000*\u0000aufirst\";s:1:\"V\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"K\u00d6BLER, J\";i:1;s:11:\"MUNDHENK, M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"RITAE4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:76:\"Probalistic complexity classes and nonuniform computational models. Workshop\";s:8:\"\u0000*\u0000title\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:12:\"EDP Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Informatique th\u00e9orique et applications (Imprim\u00e9)\";s:9:\"\u0000*\u0000stitle\";s:30:\"Inform. th\u00e9or. appl. Imprim\u00e9\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"179\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0988-3754\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ARVIND\";s:10:\"\u0000*\u0000aufirst\";s:1:\"V\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"K\u00d6BLER, J\";i:1;s:11:\"MUNDHENK, M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"RITAE4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:76:\"Probalistic complexity classes and nonuniform computational models. Workshop\";s:8:\"\u0000*\u0000title\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:12:\"EDP Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Informatique th\u00e9orique et applications (Imprim\u00e9)\";s:9:\"\u0000*\u0000stitle\";s:30:\"Inform. th\u00e9or. appl. Imprim\u00e9\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"179\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0988-3754\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ARVIND\";s:10:\"\u0000*\u0000aufirst\";s:1:\"V\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"K\u00d6BLER, J\";i:1;s:11:\"MUNDHENK, M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"RITAE4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:76:\"Probalistic complexity classes and nonuniform computational models. Workshop\";s:8:\"\u0000*\u0000title\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:12:\"EDP Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1051\/ita\/1996300201551\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Informatique th\u00e9orique et applications (Imprim\u00e9)\";s:9:\"\u0000*\u0000stitle\";s:30:\"Inform. th\u00e9or. appl. Imprim\u00e9\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"179\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0988-3754\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ARVIND\";s:10:\"\u0000*\u0000aufirst\";s:1:\"V\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"K\u00d6BLER, J\";i:1;s:11:\"MUNDHENK, M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"RITAE4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:76:\"Probalistic complexity classes and nonuniform computational models. Workshop\";s:8:\"\u0000*\u0000title\";s:51:\"Monotonous and randomized reductions to sparse sets\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:12:\"EDP Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
