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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
csr 2011
Sort
relevance
views
votes
recent
update
View
thumb
title
64
click to vote
CSR
2011
Springer
214
views
Theoretical Computer Science
»
more
CSR 2011
»
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
13 years 2 months ago
Download
logic.pdmi.ras.ru
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »