Satisfiability of Algebraic Circuits over Sets of Natural Numbers (Q5458839): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2240617993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence Problems for Circuits over Sets of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340148 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:10, 27 June 2024

scientific article; zbMATH DE number 5267229
Language Label Description Also known as
English
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
scientific article; zbMATH DE number 5267229

    Statements