Sciweavers

    91 search results - page 1 / 19
    » On value sets of polynomials over a field
    Sort
    View
    49
    Voted
    FFA
    2008
    40views more  FFA 2008»
    On value sets of polynomials over a field
    14 years 10 months ago
    On value sets of polynomials over a field
    Download  math.nju.edu.cn
    Zhi-Wei Sun
    claim paper
    Read More »
    81
    Voted
    FOCS
    2007
    IEEE
    128views Theoretical Computer Science» more  FOCS 2007»
    Hardness of Reconstructing Multivariate Polynomials over Finite Fields
    15 years 4 months ago
    Hardness of Reconstructing Multivariate Polynomials over Finite Fields
    Download  www.cs.cmu.edu
    We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
    Parikshit Gopalan, Subhash Khot, Rishi Saket
    claim paper
    Read More »
    FFA
    2008
    75views more  FFA 2008»
    Syntactical and automatic properties of sets of polynomials over finite fields
    14 years 10 months ago
    Syntactical and automatic properties of sets of polynomials over finite fields
    Download  www.discmath.ulg.ac.be
    Syntactical properties of representations of integers in various number systems are well-known and have been extensively studied. In this paper, we transpose the notion of recogniz...
    Michel Rigo
    claim paper
    Read More »
    APAL
    2010
    71views more  APAL 2010»
    On some definable sets over fields with analytic structure
    14 years 10 months ago
    On some definable sets over fields with analytic structure
    Download  websupport1.citytech.cuny.edu
    We discover geometric properties of certain definable sets over non-Archimedean valued fields with analytic structures. Results include a parameterized smooth stratification theore...
    Y. Firat Çelikler
    claim paper
    Read More »
    75
    Voted
    CIE
    2009
    Springer
    137views Applied Computing» more  CIE 2009»
    Decidability of Sub-theories of Polynomials over a Finite Field
    15 years 4 months ago
    Decidability of Sub-theories of Polynomials over a Finite Field
    Download  www.hausdorff-research-institute.uni-bonn.de
    Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
    Alla Sirokofskich
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.