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
6
search results - page 2 / 2
»
csr 2011
Sort
relevance
views
votes
recent
update
View
thumb
title
185
Voted
CSR
2011
Springer
214
views
Theoretical Computer Science
»
more
CSR 2011
»
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
14 years 7 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 »