Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
126
Voted
KGC
1997
Springer
226
views
Automated Reasoning
»
more
KGC 1997
»
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
15 years 7 months ago
Download
www2-fs.informatik.uni-tuebingen.de
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
Bernd Borchert, Frank Stephan
claim paper
Read More »